Abstract
We prove that the family Rec(ωAω) of regular sets of bi-infinite words is equal to the family of sets recognized by a deterministic Muller automaton. That extends a theorem of Mc Naughton for one sided infinite words to the case of bi-infinite words.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Beauquier, Bilimites de langages reconnaissables — TCS 33 (84) p. 335–342.
D. Beauquier, D. Perrin, Codeterministic automata on infinite words (will be published in I.P.L.)
Buchi, J.R., 1962, On a decision method in restricted second order arithmetic, in Logic, Methodology and Philosophy of Science, (Proc. 1960 Internat. Cong.), Stanford University Press, Stanford.
S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press New York (1974).
McNaughton, R., 1966, Testing and generating in finite sequences by a finite automaton, Information and Control, 9, 521–530.
M. Nivat, D. Perrin, Ensembles reconnaissables de mots bi-infinis 14th ACM Symp. on Theory of Computing (1982) 47–59.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, D. (1985). Muller automata and bi-infinite words. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028789
Download citation
DOI: https://doi.org/10.1007/BFb0028789
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive