Monadic Second-Order Logic with Arbitrary Monadic Predicates

We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic, and machine-independent characterizations. We consider the regularity question: Given a language in this class, when is it regular? To answer this, we show a substitution property and the existence of a syntactical predicate. We give three applications. The first two are to give very simple proofs that the Straubing Conjecture holds for all fragments of MSO with monadic predicates and that the Crane Beach Conjecture holds for MSO with monadic predicates. The third is to show that it is decidable whether a language defined by an MSO formula with morphic predicates is regular.

[1]  Michel Rigo,et al.  More on Generalized Automatic Sequences , 2002, J. Autom. Lang. Comb..

[2]  Yuri Gurevich,et al.  A Logic for Constant-Depth Circuits , 1984, Inf. Control..

[3]  Alexei L. Semenov,et al.  Decidability of Monadic Theories , 1984, MFCS.

[4]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[5]  Andreas Krebs,et al.  Ultrafilters on words for a fragment of logic , 2016, Theor. Comput. Sci..

[6]  Howard Straubing,et al.  Circuit Complexity and the Expressive Power of Generalized First-Order Formulas , 1992, ICALP.

[7]  Alexander Moshe Rabinovich,et al.  Decidable Theories of the Ordering of Natural Numbers with Unary Predicates , 2006, CSL.

[8]  Ivan Mitrofanov,et al.  A proof for the decidability of HD0L ultimate periodicity , 2011, 1110.4780.

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

[10]  F. Michel Dekking,et al.  Iteration of maps by an automaton , 1994, Discret. Math..

[11]  Pierre Péladeau.  Logically Defined Subsets of N k , 1992, Theor. Comput. Sci..

[12]  John Sheridan,et al.  A Myhill-Nerode theorem for automata with advice , 2012, GandALF.

[13]  Alexander Moshe Rabinovich,et al.  The Church problem for expansions of (N, <) by unary predicates , 2012, Inf. Comput..

[14]  Howard Straubing.  Formal Languages and Formal Logic , 1994 .

[15]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[16]  Alexander Moshe Rabinovich,et al.  On decidability of monadic logic of order over the naturals extended by monadic predicates , 2007, Inf. Comput..

[17]  André Nies,et al.  Describing Groups , 2007, Bulletin of Symbolic Logic.

[18]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

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

[20]  R. McNaughton.  Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.

[21]  Howard Straubing,et al.  Superlinear Lower Bounds for Bounded-Width Branching Programs , 1995, J. Comput. Syst. Sci..

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

[23]  Denis Thérien,et al.  Circuit lower bounds via Ehrenfeucht-Fraisse games , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[24]  Todor Tsankov,et al.  The additive group of the rationals does not have an automatic presentation , 2009, The Journal of Symbolic Logic.

[25]  A BarringtonDavid.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1989 .

[26]  Denis Thérien,et al.  Finite monoids and the fine structure of NC1 , 1987, STOC.

[27]  Calvin C. Elgot,et al.  Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor , 1966, J. Symb. Log..

[28]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

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

[30]  Manfred Kufleitner,et al.  Lattices of Logical Fragments over Words , 2012, ArXiv.

[31]  Charles Paperman,et al.  Monadic Second-Order Logic with Arbitrary Monadic Predicates , 2014, MFCS.

[32]  Howard Straubing,et al.  regular Languages Defined with Generalized Quantifiers , 1988, ICALP.

[33]  Richard J. Lipton,et al.  Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..

[34]  Fabien Durand,et al.  Decidability of the HD0L ultimate periodicity problem , 2011, RAIRO Theor. Informatics Appl..

[35]  Nicole Schweikardt,et al.  On the expressive power of first-order logic with built-in predicates , 2001 .

[36]  Richard J. Lipton,et al.  Unbounded Fan-In Circuits and Associative Functions , 1985, J. Comput. Syst. Sci..

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