Abstract
We use a new algebraic structure to characterize regular sets of finite and infinite words through recognizing morphisms. A one-to-one correspondence between special classes of regular ∞-languages and pseudovarieties of right binoids according to Eilenberg's theorem for regular sets of finite words is established. We give the connections to semigroup theoretical characterizations and classifications of regular ω-languages, and treat concrete classes of ∞-languages in the new framework.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold. A syntactic congruence for rational ω-languages. Theoretical Computer Science, 39:333–335, 1985.
D. Beauquier and J. E. Pin. Factors of words. In Proceedings on the 16th ICALP, pages 63–79, Berlin, 1989. Springer. LNCS 372.
B. Courcelle. On recognizable sets and tree automata. In H. Aït Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 1, pages 93–126. Academic Press, 1989.
S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976.
J.-P. Pécuchet. Etude syntaxique des parties reconnaissables de mots infinis. In L. Kott, editor, Proceedings on the 13th ICALP, pages 294–303. Springer, 1986. LNCS 226.
J.-P. Pécuchet. Variétés de semigroupes et mots infinis. In G. Vidal-Naquet, editor, Proceedings on the 3rd Symposium on Theoretical Aspects of Computer Science, pages 180–191, Berlin, Heidelberg, New York, 1986. Springer. LNCS 210.
J.-P. Pécuchet. Automates boustrophedons, languages reconnaissables de mots infinis et variétés de semigroupes. PhD thesis, Univ. Rouen, 1987.
D. Perrin. Variétés de semigroupes et mots infinis. Comptes Rendues Academie de Science Paris, 295:595–598, 1982.
D. Perrin. Recent results on automata and infinite words. In Mathematical Foundation of Computer Science, pages 134–148, Berlin, Heidelberg, New York, 1984. Springer. LNCS 176.
J.-E. Pin. Varieties of Formal Languages. North Oxford Academic Press, London, 1986.
I. Simon. Piecewise testable events. In Proceedings of the 2nd GI Conference, pages 214–222, Berlin, Heidelberg, New York, 1975. Springer Verlag. LNCS 33.
L. Staiger and K. Wagner. Automatentheoretische Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik, 10:379–392, 1974.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134–191. Elsevier Science Publishers B.V., 1980.
Th. Wilke. An EILENBERG theorem for ∞-languages. In Proceedings of the Workshop ‘Logics and Recognizable Sets', Rep. 9004, Inst. f. Informatik u. Prakt. Math., Univ. Kiel, 1990.
Th. Wilke. Eine Eilenberg-Korrespondenz für reguläre ∞-Sprachen. Diploma thesis, RWTH Aachen, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilke, T. (1991). An EILENBERG theorem for ∞-languages. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_166
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_166
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive