Logic for Unambiguous Context-Free Languages

We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing

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

[2]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[3]  Yassine Hachaïchi.  Fragments of Monadic Second-Order Logics Over Word Structures , 2005, Electron. Notes Theor. Comput. Sci..

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

[5]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[6]  Yassine Hachaïchi.  A descriptive complexity approach to the linear hierarchy , 2003, Theor. Comput. Sci..

[7]  Thomas Schwentick,et al.  Logics For Context-Free Languages , 1994, CSL.

[8]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[9]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

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

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

[12]  Georg Gottlob,et al.  Existential second-order logic over strings , 2000, JACM.

[13]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[14]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[16]  Jean-Éric Pin,et al.  Logic, semigroups and automata on words , 1996, Annals of Mathematics and Artificial Intelligence.

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

[18]  Günter Hotz,et al.  Normal-form transformations of context-free grammars , 1978, Acta Cybern..

[19]  Yassine Hacha.  Fragments of Monadic Second-Order Logics Over Word Structures , 2005 .