Stochasticity of the languages acceptable by two-way finite probabilistic automata
From MaRDI portal
Publication:3970889
DOI10.1515/dma.1991.1.4.405zbMath0796.68157MaRDI QIDQ3970889
Publication date: 25 June 1992
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1991.1.4.405
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Unbounded-error quantum computation with small space bounds, A new family of nonstochastic languages