This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.R. Buchi, On a decision method in restricted second order arithmetic, in Logic Methodology and Philosophy of Science, (Proc. 1960 Internat. Congr.), Standford University Press, Stanford, Calif (1960) 1–11.
S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol A (1974), Vol B (1976).
R. Ladner, Application of model-theoretic games to discrete linear orders and finite automata, Information and Control 33, (1977), 281–303.
R. Mc Naughton, Testing and generating infinite sequences by a finite automaton Information and Control 9, (1966), 521–530.
R. Mc Naughton and S. Pappert, Counter-free automata, MIT Press (1971).
D. Perrin, this volume.
D. Perrin, Recent results on automata and infinite words, to appear.
D. Perrin and J.E. Pin, First order logic and star-free sets, to appear.
J.E. Pin, Variétés de langages formels. Masson (1984).
W. Thomas, Star-free regular sets of ω-sequences, Information and Control 42, (1979) 148–156.
W. Thomas, A Combinatorial approach to the theory of ω-automata, Information and Control 48, (1981) 261–283.
W. Thomas, Classifying regular events in symbolic logic, J. Comput. System Science 25, (1982), 360–376.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pin, J.E. (1985). Star-free ω-languages and first order logic. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-15641-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15641-3
Online ISBN: 978-3-540-39505-8
eBook Packages: Springer Book Archive