Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages

DOI10.1007/978-3-319-40946-7_23MaRDI QIDQ2830227zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A general technique to train language models on language models
• scientific article; zbMATH DE number 475427 (Why is no real title available?)
• Mappings and grammars on trees
• On Information and Sufficiency
• Pushdown machines for weighted context-free tree translation
• Regular approximation of CFLs: A grammatical view
• The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

Cited in

(1)

• Regular Approximation of Weighted Linear Context-Free Tree Languages

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

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