A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique-Reference-Cited by-同舟云学术

A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique

Published:2001 Issue: Volume: Page:44-61
ISSN:0302-9743
Container-title:Logical Aspects of Computational Linguistics
language:
Short-container-title:

Author:

Alonso Miguel A.,de la Clergerie Eric,Vilares Manuel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48199-0_3

Reference24 articles.

1. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. Automata-based parsing in dynamic programming for Linear Indexed Grammars. In A. S. Narin’yani, editor, Proc. of DIALOGUE’97 Computational Linguistics and its Applications International Workshop, pages 22–27, Moscow, Russia, June 1997.

2. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. A redefinition of Embedded Push-Down Automata. In Proc. of 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 19–26, Paris, France, May 2000.

3. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique. In David S. Warren, Manuel Vilares, Leandro Rodríguez Liñares and Miguel A. Alonso (eds.), Proc. of Second International Workshop on Tabulation in Parsing and Deduction (TAPD 2000), pp. 101–112, Vigo, Spain, September 2000.

4. Miguel A. Alonso, Mark-Jan Nederhof, and Eric de la Clergerie. Tabulation of automata for tree adjoining languages. Grammars 3 (2000) 89–110.

5. Tilman Becker and Dominik Heckmann. Recursive matrix systems (RMS) and TAG. In Proc. of Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), pages 9–12, Philadelphia, PA, USA, August 1998.