scientific article; zbMATH DE number 7376048

DOI10.4230/LIPIcs.ICALP.2018.121zbMath1499.68171MaRDI QIDQ5002806

Guillermo A. Pérez, Filip Mazowiecki, Ranko Lazić, Laure Daviaud, Marcin Jurdziński, James Worrell

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ambiguityprobabilistic automatacontainmentemptiness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Polynomially ambiguous probabilistic automata on restricted languages ⋮ Decision Questions for Probabilistic Automata on Small Alphabets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. ⋮ The Containment Problem for Unambiguous Register Automata ⋮ Polynomially Ambiguous Probabilistic Automata on Restricted Languages ⋮ Probabilistic automata of bounded ambiguity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded-error quantum computation with small space bounds
• On the degree of ambiguity of finite automata
• The covering and boundedness problems for vector addition systems
• Deciding the value 1 problem for probabilistic leaktight automata
• Decidable and Expressive Classes of Probabilistic Automata
• What’s Decidable about Weighted Automata?
• Learning-Based Compositional Verification for Synchronous Probabilistic Systems
• Assume-Guarantee Verification for Probabilistic Systems
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Probabilistic Automata of Bounded Ambiguity
• Probabilistic automata

This page was built for publication: