Probabilistic automata of bounded ambiguity

DOI10.1016/j.ic.2020.104648zbMath1483.68165arXiv2205.08175OpenAlexW2759353025MaRDI QIDQ2064517

James Worrell, Cristian Riveros, Nathanaël Fijalkow

Publication date: 6 January 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.08175

zbMATH Keywords

weighted automataprobabilistic automatamulti-objective optimisation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Finite ambiguity and finite sequentiality in weighted automata over fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the degree of ambiguity of finite automata
• The consensus string problem and the complexity of comparing hidden Markov models.
• Deciding the value 1 problem for probabilistic leaktight automata
• Decidable Problems for Probabilistic Automata on Infinite Words
• Deciding the Value 1 Problem for Probabilistic Leaktight Automata
• Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
• On the definition of a family of automata
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Probabilistic Automata of Bounded Ambiguity
• Probabilistic automata
• The ideal view on Rackoff's coverability technique

This page was built for publication: Probabilistic automata of bounded ambiguity