Abstract
A pointed monoid, or P-monoid, is a monoid M together with a subset P of M. To any language L, one associates a characteristic P-monoid, called the syntactic P-monoid of L, denoted by Synt L. Various operations on monoids are defined. Then, using the operation L → Synt L, the following analogue of Eilenberg's variety theorem is proved : there exists an injective correspondance between cylinders (cones) of languages and cylinders (cones) of P-monoids. As an application, we give a syntactic characterization of context-free languages. Some extensions are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliographie
AUTEBERT J.M. Cylindres de langages, Thèse d'Etat, Paris (1978)
BERSTEL J. Transductions and Context-free languages. Teubner (1979)
BOASSON L. Cônes rationnels et familles agréables de langages. Application aux langages à compteur. Thèse 3ème cycle Paris (1971)
EILENBERG S. Automata, Languages and Machines, Academic Press, Vol. B (1976)
KÜNZE M. On syntactic monoïds with distinguished subsets. Non publié
PERROT J.F. Monoïdes syntactiques des languages algébriques, Acta Informatica 7, (1977), 399–413
PERROT J.F. Introduction aux monoïdes syntactiques des langages algébriques, Actes des premières journées d'informatique théorique, Bonascre 1973 (J.P. Crestin et M. Nivat édts.) ENSTA, Paris, (1978), 167–222.
PERROT J.F. et SAKAROVITCH J. A theory of syntactic monoids for context-free languages, in Information Processing 1977, (B. Grilchrist éd.), NortheHolland, 1977, 69–72.
PIN J.E. Variétés de languages et monoïde des parties. Semigroup Forum Vol. 20 (1980) 11–47.
REUTENAUER C. Sur les variétés de langages et de monoïdes. 4th GI Conference Lecture Notes in Computer Science 67, Springer (1979), 260–265.
SAKAROVITCH J. Monoïdes syntactiques et langages algébriques. Thèse 3ème cycle Paris (1976)
SAKAROVITCH J. An algebraic framework for the study of the syntactic monoids; application to the group languages. Proceedings of Mathematical Foundation of Computer Science 1976, Lecture Notes in Computer Science No 45, Springer Verlag (1977), 510–516.
SAKAROVITCH J. Monoïdes pointés. Semigroup Forum Vol 18 No 3 (1979)235–264
SAKAROVITCH J. Syntaxe des langages de Chomsky. Essai sur le déterminisme. Thèse Sciences Paris (1979).
STRAUBING H. Recognizable sets and power sets of finite semigroups. Semigroup Forum Vol 18 (1979) 331–340.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
PIN, JE. (1981). Un analogue du theoreme des varietes pour les cones et les cylindres. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017300
Download citation
DOI: https://doi.org/10.1007/BFb0017300
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive