On state-alternating context-free grammars

State-alternating context-free grammars are introduced, and the language classes obtained from them are compared to the classes of the Chomsky hierarchy as well as to some well-known complexity classes. In particular, state-alternating context-free grammars are compared to alternating context-free grammars (Theoret. Comput. Sci. 67 (1989) 75-85) and to alternating pushdown automata. Further, various derivation strategies are considered, and their influence on the expressive power of (state-) alternating context-free grammars is investigated.

[1]  Gheorghe Paun,et al.  A note on the intersection of context-free languages , 1980, Fundamenta Informaticae.

[2]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[3]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[4]  Richard J. Lipton,et al.  Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  Ivan Hal Sudborough,et al.  A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[7]  Peter Weiner,et al.  An infinite hierarchy of intersections of context-free languages , 1973, Mathematical systems theory.

[8]  Etsuro Moriya,et al.  Some Remarks on State Grammars and Matrix Grammars , 1973, Inf. Control..

[9]  Oscar H. Ibarra,et al.  A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars , 1992, Theor. Comput. Sci..

[10]  Friedrich Otto,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1995, STACS.

[11]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[12]  Daniel J. Rosenkrantz,et al.  Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[13]  Gheorghe Paun,et al.  Grammars with Controlled Derivations , 1997, Handbook of Formal Languages.

[14]  Zhi-Zhong Chen,et al.  Grammatical Characterizations of P and PSPACE , 1990 .

[15]  Etsuro Moriya,et al.  A Grammatical Characterization of Alternating Pushdown Automata , 1989, Theor. Comput. Sci..

[16]  Richard J. Lipton,et al.  Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..

[17]  Arto Salomaa,et al.  Matrix Grammars with a Leftmost Restriction , 1972, Inf. Control..

[18]  守屋 悦朗,et al.  Notes on State Grammars Operating under the Free Interpretation , 1972 .

[19]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[20]  Manfred K. Warmuth,et al.  Membership for Growing Context-Sensitive Grammars is Polynomial , 1986, J. Comput. Syst. Sci..

[21]  Henning Fernau.  Unconditional transfer in regulated rewriting , 1997, Acta Informatica.

[22]  Takumi Kasai,et al.  An Hierarchy Between Context-Free and Context-Sensitive Languages , 1970, J. Comput. Syst. Sci..