Weighted Languages Recognizable by Weighted Tree Automata
From MaRDI portal
Publication:4584658
DOI10.14232/ACTACYB.23.3.2018.9zbMATH Open1413.68065OpenAlexW2864516277WikidataQ129541505 ScholiaQ129541505MaRDI QIDQ4584658FDOQ4584658
Authors: Zsolt Gazdag, Zoltán Fülöp 
Publication date: 3 September 2018
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14232/actacyb.23.3.2018.9
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 (14)
- Regular Approximation of Weighted Linear Context-Free Tree Languages
- Title not available (Why is that?)
- Context-free recognition with weighted automata
- Title not available (Why is that?)
- Machine characterization of terminal weighted eol languages
- Title not available (Why is that?)
- Yield-languages recognized by alternating tree recognizers
- Characterizations of recognizable weighted tree languages by logic and bimorphisms
- Rational weighted tree languages with storage and the Kleene-Goldstine theorem
- Approximate minimization of weighted tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- -Treeautomata and their relation to weighted context-free grammars
- Disambiguation of weighted tree 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)
