Regular languages defined by generalized first-order formulas with a bounded number of bound variables

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

Volumn 2010, Issue , 2001, Pages 551-562

  Straubing, Howard ^a   Thérien, Denis ^b  

^a BOSTON COLLEGE   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Decidability; Definability; Hierarchies; Star free regular languages

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; COMPUTERS;

BOUND VARIABLES; DEFINABILITY; FIRST ORDER; FIRST-ORDER FORMULAS; HIERARCHIES;

ARTIFICIAL INTELLIGENCE;

EID: 84862365442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_48     Document Type: Conference Paper

References (18)

1. A. Baziramwabo, P. McKenzie and D. Thérien, “Modular Temporal Logic”, Proc. 1999 IEEE Conference on Logic in Computer Science (LICS), Trento, Italy, July 1999.
2. D. Beauquier and J. E. Pin, “Factors of Words”, Proc. 16th ICALP, Springer Lecture Notes in Computer Science 372 (1989) 63–79.
3. S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
4. K. Etessami, M. Vardi, and T. Wilke, “First-Order Logic with Two Variables and Unary Temporal Logic”, Proceedings, 12th IEEE Symposium on Logic in Computer Science, 228-235 (1996).
5. N. Immerman and D. Kozen, “Definability with a Bounded Number of Bound Variables”, Information and Computation, 83, 121-139 (1989).
6. J. Kamp, Tense Logic and the Theory of Linear Order, Ph. D. thesis, UCLA (1968).
7. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, Massachusetts, 1971.
8. S. Margolis, M. Sapir, and P. Weil, “Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata”, preprint.
9. J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986.
10. J. E. Pin and P. Weil, “Polynomial Closure and Unambiguous Product”, Theory Comput. Systems 30 (1997) 383-422.
11. J. Rhodes and B. Tilson, “The Kernel of Monoid Morphisms”, J. Pure and Applied Algebra 62 (1989) 227–268.
12. L. Ribes and P. Zaleskii, “The pro-p topology of a free group and algorithmic problems in semigroups, International Journal of Algebra and Computation 4 (1994) 359-374.
13. P. Stiffler, “Extensions of the Fundamental Theorem of Finite Semigroups”, Advances in Mathematics, 11 159-209 (1973).
14. H. Straubing, Finite Automata, Formal Languages, and Circuit Complexity, Birkhäuser, Boston, 1994.
15. H. Straubing, “Families of recognizable sets corresponding to certain varieties of finite monoids”, Journal of Pure and Applied Algebra 15 (1979), 305-318.
16. H. Straubing, D. Thérien, and W. Thomas, “Regular Languages Defined by Generalized Quantifiers”, Information and Computation 118 289-301 (1995).
17. D. Thérien and T. Wilke, “Over Words, Two Variables are as Powerful as One Quantifier Alternation,” Proc. 30th ACM Symposium on the Theory of Computing 256-263 (1998).
18. T. Wilke, “Classifying Discrete Temporal Properties”, Habilitationsschrift, University of Kiel, 1998.