Decidable and expressive classes of probabilistic automata
From MaRDI portal
Publication:1740668
DOI10.1016/j.jcss.2018.09.002zbMath1439.68011MaRDI QIDQ1740668
Publication date: 2 May 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2018.09.002
decidability; regular languages; emptiness problem; universality problem; hierarchical probabilistic automata
68Q45: Formal languages and automata
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)