On state-alternating context-free grammars

Authors:
Etsuro Moriya;Dieter Hofbauer;Maria Huber;Friedrich Otto
Affiliations:
Department of Mathematics, School of Education, Waseda University, 1-6-1, Nishi-Waseda, Shinjuku-ku, Tokyo 169-8050, Japan;Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany;Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany;Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany
Venue:
Theoretical Computer Science
Year:
2005

Citing 9
Cited 3

Membership for growing context-sensitive grammars is polynomial

Journal of Computer and System Sciences
A grammatical characterization of alternating pushdown automata

Theoretical Computer Science
A characterization of exponential-time languages by alternating context-free grammars

Theoretical Computer Science
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory

On Alternating Phrase-Structure Grammars

Language and Automata Theory and Applications
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata

IEICE - Transactions on Information and Systems
Rule systems for run-time monitoring: from eagle to ruler

RV'07 Proceedings of the 7th international conference on Runtime verification

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.