Weighted Languages Recognizable by Weighted Tree Automata
From MaRDI portal
Publication:4584658
Recommendations
- Weighted tree automata and tree transducers
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Weighted tree automata and weighted logics
- Weighted tree automata with constraints
- A Kleene theorem for weighted tree automata
- Weighted tree-walking automata
- Kleene type results for weighted tree automata
- Approximated determinisation of weighted tree automata
- Weighted automata
- scientific article; zbMATH DE number 2143011
Cited in
(16)- Disambiguation of weighted tree automata
- scientific article; zbMATH DE number 6611375 (Why is no real title available?)
- Weighted regular tree grammars with storage
- -Treeautomata and their relation to weighted context-free grammars
- scientific article; zbMATH DE number 1408339 (Why is no real title available?)
- scientific article; zbMATH DE number 2040324 (Why is no real title available?)
- scientific article; zbMATH DE number 2143011 (Why is no real title available?)
- Local weighted tree languages
- Rational weighted tree languages with storage and the Kleene-Goldstine theorem
- Machine characterization of terminal weighted eol languages
- Yield-languages recognized by alternating tree recognizers
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Approximate minimization of weighted tree automata
- Regular Approximation of Weighted Linear Context-Free Tree Languages
- scientific article; zbMATH DE number 4009842 (Why is no real title available?)
- Context-free recognition with weighted automata
This page was built for publication: Weighted Languages Recognizable by Weighted Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584658)
