Factors of words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 372 LNCS, Issue , 1989, Pages 63-79

  Beauquier, Danièle ^a   Pin, Jean Eric ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85029514966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035752     Document Type: Conference Paper

References (30)

1. A. Arnold, A syntactic congruence for rational ω-languages, Theor. Comput. Sc. 39, 1985, 333-335.
2. D. Beauquier, Bilimites de langages reconnaissables, Theor. Comput. Sc. 33, 1984, 335-342.
3. D. Beauquier, Ensembles reconnaissables de mots biinfinis, limite et determinisme in Automata on Infinite Words (M. Nivat and D. Perrin, Eds.), Lecture Notes in Computer Science 192, 1985, 28-46.
4. th ICALP (W.Brauer, Ed.), Lecture Notes in Computer Science 194, 1985, 33-42.
5. D. Beauquier, Thin homogeneous sets of factors, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 241, 239-251.
6. J.A. Brzozowski and I. Simon, Characterizations of locally testable languages, Discrete Math. 4, 1973, 243-271.
7. J.R. Büchi, On a decision method in restricted second order arithmetic, in Logic Methodology and Philosophy of Science, (Proc. 1960 Internat. Congr.), Standford University Press, stanford, California, 1960, 1-11.
8. K.J. Compton, On rich words, in Combinatorics on words, Progress and Perspectives (L.J. Cummings ed.) Academic Press 1983, 39-61.
9. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer, 1984.
10. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B, 1976.
11. R. Ladner, Application of model-theoretic game to discrete linear orders and fininte automata, Information and Control 33, 1977, 281-303.
12. G. Lallement, Semigroups and Combinatorial Applications, Wiley, New York, 1979.
13. M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics 17, AddisonWesley, New York, 1983.
14. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9, 1971, 521-530.
15. R. McNaughton, Algebraic decision procedures for local testability, Math. Syst. Theor. 8, 1974, 60-76.
16. M. Nivat and D. Perrin, Ensembles reconnaissables de mots biinfinis, Canad. J. Math. 38, 1986, 513-537.
17. J.P. Pécuchet, On the complementation of Büchi automata, Theor. Comput. Sci. 47, 1986, 95-98.
18. J.P. Pécuchet, Variétés de semigroupes et mots infinis, Proc. 3rd Symp. on Theor. Aspects of Comp. Sci. (G. Vidal-Naquet, Ed.), Lecture Notes in Computer Science 210, 1986, 180-191.
19. th ICALP (L. Kott, Ed.), Lecture Notes in Computer Science 226, 1986, 294-303.
20. D. Perrin, Recent results on automata and infinite words, Math. Found. of Comp. Sci. (M.P. Chytil, V. Koubek, Eds.), Lecture Notes in Computer Science 176, 1984, 134- 148.
21. D. Perrin, Varietes de semigroupes et mots infinis, C. R. Acad. Sci. Paris 295, 1985, 595-598.
22. D. Perrin, An introduction to finite automata on infinite words, in Automata on Infinite Words (M. Nivat and D. Perrin, Eds.), Lecture Notes in Computer Science 192, 1985, 2-17.
23. D. Perrin and J.E. Pin, First order logic and star-free sets, J. Comput. System Sci.. 32, 1986, 393-406.
24. D. Perrin and P.E. Schupp, Automata on the integers, recurrence distinguishability, and the equivalence and decidability of monadic theories, Proc. 1st Symp. on Logic in Computer Sci., 1986, 301-304.
25. J.E. Pin, Varieties of formal languages, North Oxford Academic, London and Plenum, New-York, 1986.
26. D. Thérien, A. Weiss, Graph congruences and wreath products, J. Pure Applied Algebra 35 (1985) 205-215.
27. W. Thomas, The theory of successor with an extra predicate, Math. Ann. 237 1978, 121-132.
28. W. Thomas, Star-free regular sets of ω-sequences, Information and Control 42, 1979, 148-156.
29. W. Thomas, A combinatorial approach to the theory of ω-automata, Information and Control 48, 1981, 261-283.
30. W. Thomas, Classifying regular events in symbolic logic, Journal of Computer and System Sciences 25, 1982, 360-376.