The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
Handbook of formal languages, vol. 3
Information flow in tabular interpretations for generalized push-down automata
AMiLP '95 Proceedings of the first international AMAST workshop on Algebraic methods in language processing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A study of tree adjoining grammars
A study of tree adjoining grammars
A tabular interpretation of a class of 2-Stack Automata
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.