Chapter PDF
Keywords
- Context Free Language
- Deterministic Language
- Nous Obtenons
- Deterministic Context Free Language
- Proposition Suivante
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliographie
L. BOASSON, Paires itérantes et langages algébriques, Thèse Sc. Math., Univ. Paris VII, 1974.
Y. COCHET et M. NIVAT, Une généralisation des ensembles de Dyck, Israël J. Math. 9 (1971) 389–395.
S. GINSBURG et S. GREIBACH, Deterministic Context free Languages, Inf. and Control 9 (1966) 620–648.
M. HARRISON et I. HAVEL, On the Parsing of Deterministic Languages, J. Assoc. Comput. Mach. 21 (1974) 525–548
W. OGDEN, Intercalation Theorems for Push-down Store and Stack Languages, Ph. D. Thesis, Stanford 1968.
J-F. PERROT, Monoïdes syntactiques des languages algébriques, à paraître dans les Actes de l'Ecole de Printemps sur les Langages algébriques, Bonascre 1973.
J. SAKAROVITCH, Monoïdes syntactiques et langages algébriques, Thèse de 3ème cycle, Paris, à paraître en 1975.
J. SMITH, Monoid acceptors and their relation to formal languages, Ph.D. Thesis, University of Pennesylvania, 1972.
E. VALKEMA, Zur Charakterisierung formuler Sprachen durch Halbgruppen, Dissertation, Kiel 1974.
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrot, J.F., Sakarovitch, J. (1975). Langages algebriques deterministes et groupes abeliens. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive