Decision Problems for Probabilistic Finite Automata on Bounded Languages
From MaRDI portal
Publication:4914308
DOI10.3233/FI-2013-797zbMath1279.68130OpenAlexW1560621783MaRDI QIDQ4914308
Paul C. Bell, Mika Hirvensalo, Vesa Halava
Publication date: 18 April 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2013-797
undecidabilitybounded languagesformal power seriesprobabilistic finite automataHilbert's tenth problem
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Polynomially ambiguous probabilistic automata on restricted languages, On injectivity of quantum finite automata, Freeness properties of weighted and probabilistic automata over bounded languages, Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs., Polynomially Ambiguous Probabilistic Automata on Restricted Languages, Acceptance Ambiguity for Quantum Automata