Weighted Languages Recognizable by Weighted Tree Automata

DOI10.14232/ACTACYB.23.3.2018.9zbMATH Open1413.68065OpenAlexW2864516277WikidataQ129541505 ScholiaQ129541505MaRDI QIDQ4584658FDOQ4584658

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

zbMATH Keywords

weighted tree automataweighted languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Regular Approximation of Weighted Linear Context-Free Tree Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Machine characterization of terminal weighted eol languages
• 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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximated determinisation of weighted tree automata 👍 👎
• Weighted Tree Automata and Tree Transducers 👍 👎
• Weighted tree automata and weighted logics 👍 👎
• A Kleene theorem for weighted tree automata 👍 👎
• Characterizations of recognizable weighted tree languages by logic and bimorphisms 👍 👎
• Weighted automata 👍 👎
• Weighted tree automata with constraints 👍 👎

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)