Rigorous approximated determinization of weighted automata

DOI10.1016/j.tcs.2013.02.005zbMath1291.68224OpenAlexW2097064438MaRDI QIDQ385026

Robby Lampert, Orna Kupferman, Benjamin Aminof

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

approximationweighted automatadeterminization

Mathematics Subject Classification ID

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

Related Items

A contribution to the determinization of max-plus automata ⋮ Stochastization of Weighted Automata ⋮ Quantitative vs. weighted automata ⋮ Approximated determinisation of weighted tree automata ⋮ Unnamed Item ⋮ Disambiguation of weighted tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Determinization of Weighted Finite Automata
• Expressiveness and Closure Properties for Quantitative Languages
• Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
• Approximate Determinization of Quantitative Automata
• What’s Decidable about Weighted Automata?
• Quantitative Languages
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• Planning Algorithms
• Correct Hardware Design and Verification Methods
• An approximate determinization algorithm for weighted finite-state automata

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