Rigorous approximated determinization of weighted automata

DOI10.1016/J.TCS.2013.02.005MaRDI QIDQ385026zbMATH OpenOpenAlexFDO

Authors Benjamin Aminof, Orna Kupferman, Robby Lampert

Publication date 29 November 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.02.005

zbMATH Keywords

approximationdeterminizationweighted automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• On the determinization of weighted finite automata
• Stochastization of weighted automata
• scientific article; zbMATH DE number 1223726
• An approximate determinization algorithm for weighted finite-state automata
• Non-deterministic weighted automata evaluated over Markov chains

Cites work

• An approximate determinization algorithm for weighted finite-state automata
• Approximate determinization of quantitative automata
• Correct Hardware Design and Verification Methods
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• Expressiveness and closure properties for quantitative languages
• scientific article; zbMATH DE number 5141500 (Why is no real title available?)
• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• scientific article; zbMATH DE number 2040319 (Why is no real title available?)
• scientific article; zbMATH DE number 1479635 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Making weighted containment feasible: a heuristic based on simulation and abstraction
• On the determinization of weighted finite automata
• Planning Algorithms
• Quantitative Languages
• Reasoning about online algorithms with weighted automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• What's decidable about weighted automata?

Cited in

(18)

• On deterministic weighted automata
• Non-deterministic weighted automata evaluated over Markov chains
• Disambiguation of weighted tree automata
• A contribution to the determinization of max-plus automata
• Approximated determinisation of weighted tree automata
• Quantitative vs. weighted automata
• On the determinization of weighted finite automata
• Stochastization of weighted automata
• Approximate determinization of quantitative automata
• Approximation of weighted automata with storage
• scientific article; zbMATH DE number 1223726 (Why is no real title available?)
• scientific article; zbMATH DE number 2040319 (Why is no real title available?)
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• Flow games
• scientific article; zbMATH DE number 7407779 (Why is no real title available?)
• Exact and approximate determinization of discounted-sum automata
• Optimal run problem for weighted register automata
• An approximate determinization algorithm for weighted finite-state automata

This page was built for publication: Rigorous approximated determinization of weighted automata

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