First-order logics: some characterizations and closure properties

The characterization of the class of FO[+]-definable languages by some generating or recognizing device is still an open problem. We prove that, restricted to word bounded languages, this class coincides with the class of semilinear languages. We also study the closure properties of the classes of languages definable in FO[+1], FO[<], FO[+] and FOC[+] under the main classical operations.

[1]  Neil Immerman,et al.  First-order expressibility of languages with neutral letters or: The Crane Beach conjecture , 2005, J. Comput. Syst. Sci..

[2]  Thomas Schwentick,et al.  The Descriptive Complexity Approach to LOGCFL , 1998, J. Comput. Syst. Sci..

[3]  Howard Straubing,et al.  Definability of Languages by Generalized First-Order Formulas over (N, +) , 2006, STACS.

[4]  D. H. Robinson,et al.  Parallel algorithms for group word problems , 1993 .

[5]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[6]  Pierre McKenzie,et al.  Low uniform versions of NC1 , 2011, Electron. Colloquium Comput. Complex..

[7]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[8]  Alon Orlitsky,et al.  Neural Models and Spectral Methods , 1994 .

[9]  BarringtonDavid A. Mix,et al.  Regular languages in NC1 , 1992 .

[10]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[11]  Oscar H. Ibarra,et al.  Simple Matrix Languages , 1970, Inf. Control..

[12]  Klaus-Jörn Lange,et al.  Some results on majority quantifiers over words , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[13]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[14]  James C. Corbett,et al.  On the Relative Complexity of Some Languages in NC , 1989, Inf. Process. Lett..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[17]  Nicole Schweikardt,et al.  Arithmetic, first-order logic, and counting quantifiers , 2002, TOCL.

[18]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[19]  Oscar H. Ibarra,et al.  A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata , 1974, Inf. Process. Lett..

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

[21]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[22]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[23]  Tao Jiang,et al.  Some Subclasses of Context-Free Languages In NC1 , 1988, Inf. Process. Lett..

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

[25]  K. Siu,et al.  Theoretical Advances in Neural Computation and Learning , 1994, Springer US.

[26]  Christoph Behle,et al.  FO[<]-uniformity , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[27]  S. Ginsburg,et al.  Bounded -like languages , 1964 .

[28]  Pierre McKenzie,et al.  On the Complexity of Free Monoid Morphisms , 1998, ISAAC.

[29]  Neil Immerman,et al.  Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[30]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[31]  György E. Révész.  Introduction to formal languages , 1983 .

[32]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[33]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[34]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..