The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars

DOI10.1007/978-3-642-14322-9_11zbMath1286.68287OpenAlexW3209574067MaRDI QIDQ3585002

No author found.

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14322-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Linear weighted tree automata with storage and inverse linear tree homomorphisms

This page was built for publication: The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars