Propriétés de complexité pour une famille d'algorithmes de Markov

Martine Paget

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1978)

  • Volume: 12, Issue: 1, page 15-32
  • ISSN: 0988-3754

How to cite

top

Paget, Martine. "Propriétés de complexité pour une famille d'algorithmes de Markov." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 12.1 (1978): 15-32. <http://eudml.org/doc/92061>.

@article{Paget1978,
author = {Paget, Martine},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {1},
pages = {15-32},
publisher = {EDP-Sciences},
title = {Propriétés de complexité pour une famille d'algorithmes de Markov},
url = {http://eudml.org/doc/92061},
volume = {12},
year = {1978},
}

TY - JOUR
AU - Paget, Martine
TI - Propriétés de complexité pour une famille d'algorithmes de Markov
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 1
SP - 15
EP - 32
LA - fre
UR - http://eudml.org/doc/92061
ER -

References

top
  1. 1. G. AGUZZI, F. CESARINI et R. PINZANI, Automatic Tree Structures Processingin Proceedings of Colloque de Lille : Lesarbres en Algèbre et en programmation, Lille, 1976. 
  2. 2. P. AXT, On a Subrecursive hierarchy and Primitive Recursive Degrees, Trans. Amer. Math. Soc., vol. 92, 1959, p. 85-105. Zbl0087.01102MR126377
  3. 3. A. V. AHO, J. E. HOPCROFT et J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974. Zbl0326.68005MR413592
  4. 4. P. A. BEAVEN et D. W. LEWIN, An Associative Parallel Processing System for Non Numerical Computations, The computer Journal, vol. 15, n° 4, 1972, p. 343-349. Zbl0245.68008
  5. 5. M. BLUM, A Machine Independant Theory of the Complexity of Recursive Functions, J. Assoc. Comp. Mach., vol. 14, 1967, p. 322-336. Zbl0155.01503MR235912
  6. 6. A. CARACCIOLO DI FORINO, L. SPANEDDA et N. WOLKENSTEIN, Panon 1.B: a Programming Language for Symbol Manipulation, Calcolo, 1966, p. 245-255. Zbl0221.68031MR202608
  7. 7. A. CARACCIOLO DI FORINO, Generalized Markov Algorithms and Automata, Automata theory, ed., CAIANIELLO, Academic Press New York. Zbl0192.06302
  8. 8. S. A. COOK et R. A. RECKOW, Time Bounded Rondom Access Machines, J. Comp. System. Sc. vol.7, 1973, p. 354-375. Zbl0284.68038MR327074
  9. 9. D. J. FARBER, R. E. GRISWOLD et I. P. POLONSKY, Snobol, a String Manipulation Language, J. Assoc. Comp. Mach., vol. 11, 1964, p. 21-30. Zbl0117.12201
  10. 10. B. A. GALLER et A. J. PERLIS, A view of Programming Languages, Addison Wesley, 1970. Zbl0234.68002MR272223
  11. 11. A. GRZEGORCZYCK, Some Classes of Recursive Functions, Rozprawy Matematyczne, vol. 4, Warsaw, 1953, p. 1-45 Zbl0052.24902MR60426
  12. 12. J. HARTMANIS, Computational Complexity of One Tape Turing Machine Computations, J. Assoc. Comp. Mach., vol. 15, 1968, p. 325-339. Zbl0162.31703MR252127
  13. 13. J. E. HOPCROFT et J. D. ULLMAN, Formal Languages and their Relations to Automata, Addison Wesley, 1969. Zbl0196.01701MR237243
  14. 14. J. KATZENELSON, The Markov Algorithm as a Language Parser; Linear Bounds, J. Comp. System Sc., vol. 6, 1972, p. 465-478. Zbl0247.68030MR315941
  15. 15. M. R. LAGANA, G. LEONI, R. PINZANI et R. SPRUGNOLI, Improvements in the Exexution of Markov Algorithms, Bull. Math. Ital., vol. 11, 1975, p. 473-489. Zbl0323.68030MR387038
  16. 16. G. LEONI et R. SPRUGNOLI, Some Relations between Markov Algorithms and Formal Languages, Inst. Sc. Infor. Report, S-76-4, 1976, Pisa. Zbl0374.68043MR505347
  17. 17. A. A. MARKOV, Theory of Algorithms, Traduction anglaise : Israël program for scientific translations, Jérusalem, 1961. MR181560
  18. 18. G. MICHEL, Thèse de 3e cycle, Université de Rennes, 1975. 
  19. 19. J. M. MORRIS et V. R. PRATT, A Linear Pattern Matching Algorithm, Technical Report n° 40, Univ. of California, Berkeley, 1970. 
  20. 20. M. PAGET, Applications des algorithmes de Markov à la complexité des programmes, Thèse de 3e cycle, Institut de Programmation, Université Paris-VI, 1976. Zbl0332.02041
  21. 21. R. W. RITCHIE, Class of Predictably Computable Functions, Trans. A.M.S., vol. 106, 1963. Zbl0107.01001MR158822
  22. 22. A. VAN WIJNGAARDEN, Recursive Definition of Syntax and Semanticsin Proc. I.F.I.P., 1964, North Holland, Amsterdam, 1966, p. 13-24. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.