Miguel Angel Alonso Pardo
Eric Villemonte de la Clergerie
David Cabrero Souto
in Proc. of the Sixth Meeting on Mathematics of Language (MOL 6), pp. 127-141, Orlando, Florida, USA, July 1999.
We try to provide a common framework to clarify the relationships between different automata and their associated tabulation techniques for Tree Adjoning Languages, a subclass of Mildly Context-Sensitive Languages. We have chosen Logic Push-down Automata working with Linear Indexed Grammars as a starting point. Several tabulation techniques for different parsing strategies are proposed and compared with previous approaches.