Regular Approximation of Weighted Linear Context-Free Tree Languages

DOI10.1142/S0129054117400056zbMath1380.68261MaRDI QIDQ4605512

Markus Teichmann

Publication date: 22 February 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximationcontext-free tree languagesweighted tree grammar

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
• Closure properties of linear context-free tree languages with an application to optimality theory
• Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
• Pushdown tree automata
• Pushdown Machines for Weighted Context-Free Tree Translation
• A General Technique to Train Language Models on Language Models
• Non-self-embedding linear context-free tree grammars generate regular tree languages
• Mappings and grammars on trees
• On Information and Sufficiency

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