Chapter PDF
Keywords
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
J. BERSTEL Transductions and Context-Free Languages. Teubner (1979)
J. BRZOZOWSKI Hierarchies of aperiodic languages, RAIRO Informatique Théorique, Vol 10 (1976), 33–49.
J. BRZOZOWSKI Open problems about regular languages, Proc. Formal Language Theory Symposium, Santa Barbara, December 1979.
S. EILENBERG Automata, Languages and Machines, Vol B, Academic Press, New-York (1976).
G. LALLEMENT Semigroups and Combinatorial applications, Wiley, New-York, (1979).
S.W. MARGOLIS à paraître
S.W. MARGOLIS et J.E? PIN Minimal non-commutative variéties of finite monoids. Soumis pour publication.
S.W. MARGOLIS et J.E. PIN On variéties of rational languages and variable-length codes II. En préparation.
J.E. PIN On varieties of rational languages and variable-length codes. A paraître dans Journal of Pure and Applied Algebra.
J.E. PIN Variétés de langages et monoïde des parties, Semigroup Forum vol 20 (1980) 11–47.
J.E. PIN Une caractérisation de trois variétés de langages bien connues 4th GI Conference, Lecture Notes in Computer Science No 67 Springer (1979) 233–243.
J.E. PIN Propriétés syntactiques du produit non ambigu. 7th ICALP. Lecture Notes in Computer Science No 85 Springer (1980) 483–499.
J.E. PIN Variétés de langages et variétés de semigroupes. Thèse Paris (1981).
J.E. PIN et J. SAKAROVITCH Une application de la représentation matricielle des transductions. En préparation.
Chr. REUTENAUER Sur les variétés de langages et de monoïdes. 4th GI conference Lecture Notes in Computer Science 67, Springer (1979), 260–265.
H. STRAUBING Varieties of recognizable sets whose syntactic monoids contain solvable groups. Ph. D. Thesis, University of California, Berkeley (1978)
H. STRAUBING Aperiodic homomorphisms and the concatenation product of recognizable sets. J. Pure and Applied Algebra, Vol. 15, 1979, 319–327.
H. STRAUBING Recognizable sets and power sets of finite semigroups. Semigroup Forum Vol 18 (1979) 331–340.
B. TILSON Chapitres 11 et 12 de la référence (4).
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). Langages Reconnaissables et Codage Prefixe Pur. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive