Approximated determinisation of weighted tree automata

DOI10.1007/978-3-030-68195-1_20MaRDI QIDQ2232287zbMATH OpenOpenAlexFDO

Authors Frederic Dörband, Thomas Feller, Kevin Stier

Publication date 4 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-68195-1_20

zbMATH Keywords

approximated determinisationapproximationtree automatatwinning propertyweighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Approximate determinization of quantitative automata
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Degree of sequentiality of weighted automata
• Determinization of weighted tree automata using factorizations
• Exact and approximate determinization of discounted-sum automata
• Finite sequentiality of unambiguous max-plus tree automata
• Handbook of weighted automata
• scientific article; zbMATH DE number 5141500 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)
• Rigorous approximated determinization of weighted automata
• Weighted finite automata over strong bimonoids
• Weighted grammars and Kleene's theorem

Cited in

(8)

• Stochastically costed tree automata: Turakainen's theorem
• Approximate weighted model integration on DNF structures
• Disambiguation of weighted tree automata
• Approximate consistency for transformations on words and trees
• scientific article; zbMATH DE number 6611375 (Why is no real title available?)
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
• Weighted Languages Recognizable by Weighted Tree Automata
• Regular Approximation of Weighted Linear Context-Free Tree Languages

This page was built for publication: Approximated determinisation of weighted tree automata

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