Logic, semigroups and automata on words

Annals of Mathematics and Artificial Intelligence

Volumn 16, Issue 1, 1996, Pages 343-384

  Pin, Jean Eric ^a,b  

^a Bull Research and Development   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344469408     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02127803     Document Type: Article

References (19)

1. J. Almeida, Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon, J. Pure Appl. Algebra 69(1990)205-218.
2. M. Arfi, Polynomials operations and relational languages, 4th STACS, Lecture Notes in Computer Science 247 (Springer, 1987) pp. 198-206.
3. M. Arfi, Opérations polynomiales et hiérarchies de concaténation, Theor. Comput. Sci. 91(1991) 71-84.
4. A. Arnold, A syntactic congruence for rational ω-languages, Theor. Comput. Sci. 39(1985) 333-335.
5. D. Beauquier, Bi-limites de langages reconnaissables, Theor. Comput. Sci. 33(1984)335-342.
6. D. Beauquier, Ensembles reconnaissables de mots bi-infinis, in: Automata on Infinite Words, ed. M. Nivat, Lecture Notes in Computer Science 192 (Springer, 1985) pp. 28-46.
7. D. Beauquier and M. Nivat, About rational sets of factors of a bi-infinite word, in: Automata, Languages and Programming, ed. W. Brauer, Lecture Notes in Computer Science 194 (Springer, 1985) pp. 33-42.
8. D. Beauquier and J.E. Pin, Factors of words, in: Automata, Languages and Programming, eds. G. Ausiello, M. Dezani-Ciancaglini and S. Ronchi Della Rocca, Lecture Notes in Computer Science 372 (Springer, 1989) pp. 63-79.
9. D. Beauquier and J.E. Pin, Languages and scanners, Theor. Comput. Sci. 84(1991)3-21.
10. J.A. Brzozowski and R. Knast, The dot-depth huerarchy of star-free languages is infinite, J. Comput. Syst. Sci. 16(1978)37-55.
11. J.A. Brzozowski and I. Simon, Characterizations of locally testable languages, Discr. Math. 4(1973)243-271.
12. J.R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik und Grundl. Math. 6(1960)66-92.
13. J.R. Büchi, On a decision method in restricted second-order arithmetic. Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science (Stanford University Press, Stanford, 1962) pp. 1-11.
14. J.R. Búchi and L.H. Landweber, Definability in the monadic second-order theory of successors, J. Symb. Logic 34(1969)166-170.
15. S. Cho and D.T. Huynh, Finite automaton aperiodicity is PSPACE-complete, Theor. Comput. Sci. 88(1991)99-116.
16. J. Cohen, On the expressive power of temporal logic for infinite words, Theor. Comput. Sci. 83(1991)301-312.
17. J. Cohen, D. Perrin and J.E. Pin, On the expressive power of temporal logic, J. Comput. Syst. Sci. (1993).
18. K. Compton, On rich words, in: Combinatoric Words, Progress and Perspectives, ed. L. Cummings (Academic Press, 1983) pp. 39-62
19. D. Cowan, Inverse monoids of dot-depth 2, Int. J. Alg. Comp. 3(1993)411-424.