This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Arnold, A., 1983, Rational ω-languages are non-ambiguous, Theoret. Comput. Sci., 26, 221–224.
Arnold, A., 1984, A syntactic congruence for rational ω-languages, to appear in Theoret. Comput. Sci.
Beauquier, D., 1984, Bilimites de langages reconnaissables, to appear in Theoret. Comput. Sci.
Beauquier, D., Perrin, D., 1984, Automates codeterministes sur les mots infinis, to appear.
Compton, L., 1984, in Progress in Combinatorics on Words, Academic Press.
Büchi, J.R., 1962, On a decision method in restricted second order arithmetic, in Logic, Methodology and Philosophy of Science, (Proc. 1960 Internat. Congr.), Stanford University Press, Stanford, Calif., 1–11.
Eilenberg, S., 1974, Automata, Languages and Machines, Vol. A, Academic Press, New York, Vol. B, 1976.
Lallement, G., 1979, Semigroups and Combinatorial Applications, Wiley.
Landweber, L.H., 1969, Decision problems for ω-automata, Math. Syst. Theory, 3, 376–384.
McNaughton, R., 1966, Testing and generating infinite sequences by a finite automaton, Information and Control, 9, 521–530.
Mostowski, A., 1982, Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indices, Information Processing Letters, 15, 159–163.
Nivat, M., Perrin D., 1982, Ensembles reconnaissables de mots biinfinis, Proc. 14th ACM Symp. on Theory of Computing, 47–59.
Pécuchet, J.P., 1983, Automates boustrophédons et mots infinis, à paraitre dans Theoret. Comput. Sci.
Perrin D., Variétés de langages et mots infinis, C.R. Acad. Sci. Paris, 295, 595–598.
Pin, J.E., Variétés de langages formels, Masson, 1984.
Schützenberger, M.P., 1972, Sur les relations rationnelles fonctionnelles, in Automata, Languages and Programming (M. Nivat ed.) North Holland, 103–114.
Thomas, W., 1979, Star free regular sets of ω-sequences, Inform. Control, 42, 148–156.
Thomas, W., 1981, A combinatorial approach to the theory of ω-automata, Inform. Control, 48, 261–283.
Thomas, W., 1982, A hierarchy of sets of infinite trees, in Theoretical Computer Science, Springer Lecture Notes on Comput. Sci., 145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrin, D. (1984). Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030294
Download citation
DOI: https://doi.org/10.1007/BFb0030294
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive