The expressive power of existential first order sentences of büchi’s sequential calculus

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

Volumn 1099, Issue , 1996, Pages 300-311

  Pin, Jean Eric ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

BOOLEAN COMBINATIONS; EXISTENTIAL FORMULA; EXPRESSIVE POWER; FIRST ORDER SENTENCES; FIRST ORDER THEORIES; POLYNOMIAL-TIME ALGORITHMS; SEQUENTIAL CALCULUS; VARIETY THEOREM;

CALCULATIONS;

EID: 84947742853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_137     Document Type: Conference Paper

References (27)

1. J. Almeida, Finite semigroups and universal algebra., Series in Algebra Vol 3, Word Scientific, Singapore, 1994.
2. D. Beauquier and J.-E. Pin, Factors of words, in Automata, languages and Programming, (G. Ausiello, M. Dezani-Ciancaglini and S. Ronchi Delia Rocca, eds.), Lecture Notes in Comput. Sei. 372, Springer, (1989), 63-79.
3. D. Beauquier and J.-E. Pin, Languages and scanners, Theoret. Comput. Sei. 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, in Proc. 1960 Int. Congi. for Logic, Methodology and Philosophy of Science, Stanford Univ. Press, Standford, (1962), 1-11.
6. S. Cho and D.T. Huynh, Finite automaton aperiodicity is PSPACE-complete, Theoret. Comput. Sei. 88, (1991), 99-116.
7. Ebbinghaus and Flum, Finite Model Theozy, Springer, (1995).
8. S. Eilenberg, Automata, languages and machines, Vol. B, Academic Press, New York, 1976.
9. H. Gaifman, On local and non-local properties, in Proc. of the Herbrandt Symposium, Logic Colloquium'81 (J. Stern, ed.), Studies in Logic 107, North-Holland, Amsterdam, (1982), 105-135.
10. R. McNaughton, Algebraic decision procedures for local testability, Math. Syst. Theor. 8, (1974), 60-76.
11. R. McNaughton and S. Pappert, Counter-free Automata., MIT Press, 1971.
12. D. Perrin, Automata, Chapter 1 in Handbook of Theoretical Computer Science (Van Leeuwen, J. ed.), Vol B: Formal Models and Semantics, Elsevier (1990).
13. D. Perrin and J.-E. Pin, First order logic and star-free sets, J. Comput. System Sei. 32, (1986), 393-406.
14. J.-E. Pin, Variétés de langages formels, Masson, Paris, 1984. English translation: Varieties of formal languages, Plenum, New-York, 1986.
15. J.-E. Pin, Logic, Semigroups and Automata on Words, Theor. Сотр. Sc., to appear.
16. J.-E. Pin, Finite semigroups and recognizable languages: an introduction, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer academic publishers, (1995), 1-32.
17. J.-E. Pin, A variety theorem without complementation, Izvestiya VUZ Mate-matika 39 (1995) 80-90. English version, Russian Mathem. (Iz. VUZ) 39, (1995), 74-83.
18. M.P. Schiitzenberger, On finite monoids having only trivial subgroups, Information and Control 8, (1965), 190-194.
19. J. Stern, Characterization of some classes of regular events, Theoret. Сотр. Sei. 35, (1985), 17-42.
20. J. Stern, Complexity of some problems from the theory of automata, Inform, and Control 66, (1985), 63-176.
21. H. Straubing, Finite automata, formal logic and circuit complexity, Birkhäuser, 1994.
22. H. Straubing, D. Thérien and W. Thomas, Regular Languages Defined with Generalized Quantifiers, in Proc. 15th ICALP, Springer Lecture Notes in Computer Science 317, (1988), 561-575.
23. D. Thérien and A. Weiss, Graph congruences and wreath products, J. Pure Applied Algebra 35, (1985), 205-215.
24. W. Thomas, Classifying regular events in symbolic logic, J. Comput. Syst. Sei 25, (1982), 360-375.
25. W. Thomas, On logics, tilings, and automata, Proc. 18th ICALP, Madrid, (J. Leach Albert et al., eds.), Led. Notes in Comp. Sei. 510, Springer, Berlin, (1991), 441-454.
26. W. Thomas, On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science, TAPSOFT93, M.C. Gaudel, LP. Jouannaud (Eds), Led. Notes in Сотр. Sei. 668, Springer, Berlin, (1993), 559-568.
27. Th. Wilke, Locally threshold testable languages of infinite words, in STACS 93, P. Enjalbert, A. Finkei, K.W. Wagner (Eds.), Lect. Notes in Comp. Sei. 665, Springer, Berlin, (1993), 607-616.