On state-alternating context-free grammars

Etsuro Moriya; Dieter Hofbauer; Maria Huber; Friedrich Otto

doi:10.1016/j.tcs.2004.12.029

On state-alternating context-free grammars

Etsuro Moriya^*, Dieter Hofbauer, Maria Huber, Friedrich Otto

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

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.

Original language	English
Pages (from-to)	183-216
Number of pages	34
Journal	Theoretical Computer Science
Volume	337
Issue number	1-3
DOIs	https://doi.org/10.1016/j.tcs.2004.12.029
Publication status	Published - 2005 Jun 9

Keywords

Alternating context-free grammar
Alternating pushdown automaton
Context-free grammar with states
State-alternating context-free grammar

ASJC Scopus subject areas

Computational Theory and Mathematics

Access to Document

10.1016/j.tcs.2004.12.029

Cite this

@article{7b49fc249a4e4c5b9a7cc4dbba13aea9,

title = "On state-alternating context-free grammars",

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.",

keywords = "Alternating context-free grammar, Alternating pushdown automaton, Context-free grammar with states, State-alternating context-free grammar",

author = "Etsuro Moriya and Dieter Hofbauer and Maria Huber and Friedrich Otto",

year = "2005",

month = jun,

day = "9",

doi = "10.1016/j.tcs.2004.12.029",

language = "English",

volume = "337",

pages = "183--216",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On state-alternating context-free grammars

AU - Moriya, Etsuro

AU - Hofbauer, Dieter

AU - Huber, Maria

AU - Otto, Friedrich

PY - 2005/6/9

Y1 - 2005/6/9

N2 - 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.

AB - 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.

KW - Alternating context-free grammar

KW - Alternating pushdown automaton

KW - Context-free grammar with states

KW - State-alternating context-free grammar

UR - http://www.scopus.com/inward/record.url?scp=18444383376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18444383376&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2004.12.029

DO - 10.1016/j.tcs.2004.12.029

M3 - Article

AN - SCOPUS:18444383376

SN - 0304-3975

VL - 337

SP - 183

EP - 216

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

On state-alternating context-free grammars

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this