Search in ATOLL bibliographyall |
PS|PDF|HTML BIB|Raw BIB|Submit
Communications à des congrés, colloques, etc.
Tabulation of automata for tree adjoining languages.
In Sixth Meeting on Mathematics of Language (MOL6), 1999.
Miguel A. Alonso Pardo, David Cabrero Souto, and Éric
Villemonte de La Clergerie.
This paper provides 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
Eric de la ClergerieHome Page