On logical descriptions of regular languages

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

Volumn 2286, Issue , 2002, Pages 528-538

  Straubing, Howard ^a  

^a BOSTON COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

MODEL-THEORETIC; MORPHISMS; PREDICATE LOGIC; SYNTACTIC MONOIDS; SYNTACTIC MORPHISM; VARIETY THEOREM;

COMPUTER CIRCUITS;

EID: 84937402940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_46     Document Type: Conference Paper

References (14)

1. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, Singapore, 1994.
2. D. Mix Barrington, K. Compton, H. Straubing, and D. Thérien, “Regular Languages in NC1”, J. Comp. Syst. Sci. 44 (1992) 478–499.
3. J. Brzozowski and I. Simon, “Characterizations of Locally Testable Events”, Discrete Math. 4 (1973) 243–271.
4. J. R. Büchi, “Weak Second-order Arithmetic and Finite Automata”, Z. Math. Logik Grundl. Math. 6 66-92 (1960).
5. S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
6. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, Massachusetts, 1971.
7. J. E. Pin, Varieties of Formal Languages, Plenum, London, 1986.
8. J.-E. Pin, A variety theorem without complementation, Russian Mathematics (Izvestija vuzov.Matematika) 39 (1995), 80–90.
9. J.-E. Pin, H. Straubing and D. Thrien, “New results on the generalized star-height problem”, Information and Computation 101 219-250 (1992).
10. H. Straubing, Finite Automata, Formal Languages, and Circuit Complexity, Birkhäuser, Boston, 1994.
11. H. Straubing and D. Thérien, “Regular Languages Defined by Generalized First-Order Sentences with a Bounded Number of Bound Variables”, in STACS 2001, Springer, Berlin 551-562 (2001) (Lecture Notes in Computer Science 2010.)
12. H. Straubing, D. Thérien, and W. Thomas, “Regular Languages Defined by Generalized Quantifiers”, Information and Computation 118 289-301 (1995).
13. 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).
14. W. Thomas, “Classifying Regular Events in Symbolic Logic”, J. Computer and System Sciences 25 (1982) 360–376.