论文信息 - A redefinition of Embedded Push-Down Automata

A redefinition of Embedded Push-Down Automata

A new definition of Embedded Push-Down Automata is provided. W e prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to th e length of the input string.

Miguel A. Alonso | Manuel Vilares Ferro | Éric Villemonte de la Clergerie | Eric Villemonte de la Clergerie | M. Ferro

[1] Gerald Gazdar,et al. Applicability of Indexed Grammars to Natural Languages , 1988 .

[2] Aravind K. Joshi,et al. A study of tree adjoining grammars , 1987 .

[3] David J. Weir,et al. LINEAR ITERATED PUSHDOWNS , 1994, Comput. Intell..

[4] Miguel A. Alonso,et al. A Tabular Interpretation of a Class of 2-Stack Automata , 1998, COLING-ACL.

[5] Bernard Lang,et al. Towards a Uniform Formal Framework for Parsing , 1991 .