Tabulation of automata for tree-adjoining languages

DOI10.1023/A:1009967013686MaRDI QIDQ5931123zbMATH OpenFDO

Authors Miguel Á. Alonso Pardo, Mark-Jan Nederhof, Eric Villemonte de la Clergerie

Publication date 27 November 2001

Published in Grammars (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1009967013686

zbMATH Keywords

tabular parsing algorithmstree-adjoining languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2150299
• scientific article; zbMATH DE number 1786544
• Tabular parsing and algebraic transformations
• Tree-Adjoining Language Parsing in O(n^6 ) Time
• An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages

Cited in

(5)

• Information flow in tabular interpretations for generalized push-down automata
• Tabular parsing and algebraic transformations
• scientific article; zbMATH DE number 1088283 (Why is no real title available?)
• scientific article; zbMATH DE number 1962765 (Why is no real title available?)
• scientific article; zbMATH DE number 2085263 (Why is no real title available?)

This page was built for publication: Tabulation of automata for tree-adjoining languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931123)