ON ALTERNATING PHRASE-STRUCTURE GRAMMARS
From MaRDI portal
Publication:5187849
DOI10.1142/S0129054110007106zbMath1186.68239OpenAlexW2002749975MaRDI QIDQ5187849
Publication date: 9 March 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054110007106
Cites Work
- Unnamed Item
- On state-alternating context-free grammars
- Membership for growing context-sensitive grammars is polynomial
- A grammatical characterization of alternating pushdown automata
- A characterization of exponential-time languages by alternating context- free grammars
- Growing context-sensitive languages and Church-Rosser languages
- A hierarchy between context-free and context-sensitive languages
- Alternating Pushdown and Stack Automata
- Alternation
- A note on asymmetry in phrase structure grammars