Approximate determinization of quantitative automata
From MaRDI portal
Recommendations
Cited in
(21)- Non-deterministic Weighted Automata on Random Words
- Discounted-sum automata with multiple discount factors
- Approximate learning of limit-average automata
- scientific article; zbMATH DE number 3305070 (Why is no real title available?)
- Between deterministic and nondeterministic quantitative automata (invited talk)
- Non-deterministic weighted automata evaluated over Markov chains
- Exact and approximate determinization of discounted-sum automata
- scientific article; zbMATH DE number 2240006 (Why is no real title available?)
- scientific article; zbMATH DE number 7577577 (Why is no real title available?)
- Determinizing discounted-sum automata
- Approximated determinisation of weighted tree automata
- Discounted-sum automata with multiple discount factors
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Quantitative monitor automata
- Quantitative safety and liveness
- Approximate comparison of distance automata
- Quantitative vs. weighted automata
- Rigorous approximated determinization of weighted automata
- Quasi-deterministic virtual finite automaton (QDVFA) of order s
- Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
- Quasi-deterministic 0L systems and their representation
This page was built for publication: Approximate determinization of quantitative automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957513)
