Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages

DOI10.1007/978-3-319-40946-7_23zbMath1379.68232OpenAlexW2478685222MaRDI QIDQ2830227

Markus Teichmann

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Measures of information, entropy (94A17)

Related Items (1)

Regular Approximation of Weighted Linear Context-Free Tree Languages

Cites Work

• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Pushdown Machines for Weighted Context-Free Tree Translation
• A General Technique to Train Language Models on Language Models
• Mappings and grammars on trees
• On Information and Sufficiency
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages