Logics For Context-Free Languages

We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.

[1]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[2]  Thomas Schwentick.  Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree , 1995, ICALP.

[3]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[4]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[6]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[7]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[8]  Ronald Fagin,et al.  On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[9]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

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

[11]  Pierre McKenzie,et al.  Extensions to Barrington's M-Program Model , 1993, Theor. Comput. Sci..

[12]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[14]  James F. Lynch,et al.  On sets of relations definable by addition , 1982, Journal of Symbolic Logic.

[15]  Michel de Rougemont.  Second-order and Inductive Definability on Finite Structures , 1987, Math. Log. Q..

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

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

[18]  Thomas Schwentick,et al.  Graph connectivity and monadic NP , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.