Journal of the ACM (JACM)
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
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
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
English and the class of context-free languages
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Conjunctive Grammars and Alternating Pushdown Automata
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Defining contexts in context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
In this paper we introduce a sub-family of synchronized alternating pushdown automata, Deterministic Synchronized Alternating Pushdown Automata, and a sub-family of conjunctive grammars, LR(0) Conjunctive Grammars. We prove that deterministic SAPDA and LR(0) conjunctive grammars have the same recognition/generation power, analogously to the classical equivalence between acceptance by empty stack of deterministic PDA and LR(0) grammars. These models form the theoretical basis for efficient, linear, parsing of a rich sub-family of conjunctive languages, which properly includes all the boolean combinations of context-free LR(0) languages.