Probabilistic automata with isolated cut-points

DOI10.1007/978-3-642-40313-2_24MaRDI QIDQ2849915zbMATH OpenOpenAlexFDO

Authors Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The complexity properties of probabilistic automata with isolated cut point
• The complexity of probabilistic versus deterministic finite automata
• Probabilistic automata on finite words: decidable and undecidable problems
• Polynomially ambiguous probabilistic automata on restricted languages
• scientific article; zbMATH DE number 3862442

Cited in

(7)

• The complexity properties of probabilistic automata with isolated cut point
• Decidable and expressive classes of probabilistic automata
• Polynomially ambiguous probabilistic automata on restricted languages
• Two recursively inseparable problems for probabilistic automata
• Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
• Decision problems for probabilistic finite automata on bounded languages
• Approximating probabilistic automata by regular languages

This page was built for publication: Probabilistic automata with isolated cut-points

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