On Alternating Phrase-Structure Grammars

Authors:
Etsuro Moriya;Friedrich Otto
Affiliations:
Advanced Research Institute for Science and Engineering and Department of Mathematics, School of Education, Waseda University, Tokyo, Japan 169-8050;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany 34109
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 13
Cited 0

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
Aspects of classical language theory

Handbook of formal languages, vol. 1
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
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
On state-alternating context-free grammars

Theoretical Computer Science
Alternation

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Alternating pushdown automata

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata

IEICE - Transactions on Information and Systems
An hierarchy between context-free and context-sensitive languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.