On Logical Descriptions of Regular Languages

There are many examples in the research literature of families of regular languages defined by purely model-theoretic means (that is, in terms of the kinds of formulas of predicate logic used to define them) that can be characterized algebraically (that is, in terms of the syntactic monoids or syntactic morphisms of the languages). In fact the existence of such algebraic characterizations appears to be the rule. The present paper gives an explanation of the phenomenon: A generalization of Eilenberg's variety theorem is proved, and then applied to logic. We find that a very wide assortment of families of regular languages defined in model-theoretic terms form varieties in this new sense,and that consequently membership in the family depends only on the syntactic morphism of the language.

[1]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[2]  Howard Straubing,et al.  New Results on the Generalized Star-Height Problem , 1989, STACS.

[3]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[4]  Robert McNaughton,et al.  Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[5]  Howard Straubing,et al.  Some Results on the Generalized Star-Height Problem , 1992, Inf. Comput..

[6]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[7]  Howard Straubing,et al.  Regular Languages in NC¹ , 1992, J. Comput. Syst. Sci..

[8]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[9]  Howard Straubing,et al.  Regular Languages Defined with Generalized Quanifiers , 1995, Inf. Comput..

[10]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[11]  Howard Straubing,et al.  Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables , 2002, Theory of Computing Systems.

[12]  Jean-Eric Pin,et al.  A variety theorem without complementation , 1995 .

[13]  Jorge Almeida,et al.  Finite Semigroups and Universal Algebra , 1995 .

[14]  Samuel Eilenberg.  Automata, Languages and Machines, Vol. B , 1976 .

[15]  Raymond E. Miller,et al.  Varieties of Formal Languages , 1986 .

[16]  Janusz A. Brzozowski,et al.  Characterizations of locally testable events , 1973, Discret. Math..

[17]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[18]  Thomas Wilke,et al.  Over words, two variables are as powerful as one quantifier alternation , 1998, STOC '98.