Expressive power of existential first-order sentences of Büchi's sequential calculus

Discrete Mathematics

Volumn 291, Issue 1-3, 2005, Pages 155-174

  Pin, Jean Eric ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Automata; First order; Logic; Semigroups; Successor

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; CHARACTERIZATION; COMBINATORIAL MATHEMATICS; FORMAL LOGIC; MATHEMATICAL OPERATORS; OPTIMIZATION; SET THEORY;

AUTOMATA; FIRST-ORDER; LOGIC; SEMIGROUPS; SUCCESSOR;

NUMERICAL METHODS;

EID: 14544307819     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.04.027     Document Type: Conference Paper

References (27)

1. J. Almeida Finite Semigroups and Universal Algebra, Series in Algebra vol. 3 1994 World Scientific Singapore
2. D. Beauquier, J.-E. Pin, Factors of words, in: G. Ausiello, M. Dezani-Ciancaglini, S. Ronchi Della Rocca (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 372, Springer, Berlin, 1989, pp. 63-79.
3. D. Beauquier, and J.-E. Pin Languages and scanners Theoret. Comput. Sci. 84 1991 3 21
4. J.A. Brzozowski, and I. Simon Characterizations of locally testable languages Discrete Math. 4 1973 243 271
5. J.R. Büchi On a decision method in restricted second-order arithmetic Proceedings of the 1960 International Congress for Logic, Methodology and Philosophy of Science 1962 Stanford University Press Stanford 1 11
6. S. Cho, and D.T. Huynh Finite automaton aperiodicity is PSPACE-complete Theoret. Comput. Sci. 88 1991 99 116
7. J. Cohen, D. Perrin, and J.-E. Pin On the expressive power of temporal logic J. Comput. System Sci. 46 1993 271 294
8. H.D. Ebbinghaus, and J. Flum Finite Model Theory 1995 Springer Berlin
9. S. Eilenberg Automata, Languages and Machines vol. B 1976 Academic Press New York
10. H. Gaifman On local and non-local properties J. Stern Proceedings of the Herbrandt Symposium, Logic Colloquium'81, Studies in Logic vol. 107 1982 North-Holland Amsterdam 105 135
11. R. McNaughton Algebraic decision procedures for local testability Math. Systems Theory 8 1974 60 76
12. R. McNaughton, and S. Pappert Counter-free Automata 1971 MIT Press Cambridge, MA
13. D. Perrin, Automata, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990 (Chapter 1).
14. D. Perrin, and J.-E. Pin First-order logic and star-free sets J. Comput. System Sci. 32 1986 393 406
15. J.-E. Pin, Variétés de langages formels, Masson, Paris, 1984 English translation: Varieties of formal languages, Plenum, New York, 1986.
16. J.-E. Pin, Variétés de langages formels, Masson, Paris, 1984 English translation: Varieties of formal languages, Plenum, New York, 1986.
17. J.-E. Pin Finite semigroups and recognizable languages an introduction, in NATO Advanced Study Institute Semigroups J. Fountain Formal Languages and Groups 1995 Kluwer Academic Publishers Dordrecht 1 32
18. J.-E. Pin, The expressive power of existential first-order sentences of Büchi's sequential calculus, ICALP 1996, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 300-311.
19. J.-E. Pin Logic, Semigroups and Automata on Words Ann. Math. Artificial Intelligence 16 1996 343 384
20. M.P. Schützenberger On finite monoids having only trivial subgroups Inform. and Control 8 1965 190 194
21. J. Stern Complexity of some problems from the theory of automata Inform. and Control 66 1985 63 176
22. H. Straubing Finite Automata, Formal Logic and Circuit Complexity 1994 Birkhäuser Basel
23. D. Thérien, and A. Weiss Graph congruences and wreath products J. Pure Appl. Algebra 35 1985 205 215
24. W. Thomas Classifying regular events in symbolic logic J. Comput. Syst. Sci. 25 1982 360 375
25. W. Thomas, On logics, tilings, and automata, in: J. Leach Albert, et al. (Eds.), Proceedings of the 18th ICALP, Madrid, Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 441-454.
26. W. Thomas, On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science, in: M.C. Gaudel, J.P. Jouannaud (Eds.), Proceedings of the TAPSOFT'93, Lecture Notes in Computer Science, vol. 668, Springer, Berlin, 1993, pp. 559-568.
27. Th. Wilke, Locally threshold testable languages of infinite words, in: P. Enjalbert, A. Finkel, K.W. Wagner (Eds.), Proceedings of the STACS 93, Lecture Notes in Computer Science, vol. 665, Springer, Berlin, 1993, pp. 607-616.