Regular Approximation of Weighted Linear Context-Free Tree Languages
From MaRDI portal
Recommendations
- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
- Approximated determinisation of weighted tree automata
- Nondeterministic tree width of regular languages
- Weighted Languages Recognizable by Weighted Tree Automata
- Asymptotic approximation by regular languages
- Approximate minimization of weighted tree automata
- Approximation of smallest linear tree grammar
- Approximation of smallest linear tree grammar
- Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Cites work
- A general technique to train language models on language models
- Closure properties of linear context-free tree languages with an application to optimality theory
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Mappings and grammars on trees
- Non-self-embedding linear context-free tree grammars generate regular tree languages
- On Information and Sufficiency
- Pushdown machines for weighted context-free tree translation
- Pushdown tree automata
- Regular approximation of CFLs: A grammatical view
- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
Cited in
(4)
This page was built for publication: Regular Approximation of Weighted Linear Context-Free Tree Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605512)
