Stochasticity of the languages acceptable by two-way finite probabilistic automata

DOI10.1515/dma.1991.1.4.405zbMath0796.68157OpenAlexW2091559907MaRDI QIDQ3970889

Ya. Ya. Kanep

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

zbMATH Keywords

recognition of languagesstochastic languagesfinite probabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

A new family of nonstochastic languages ⋮ Unbounded-error quantum computation with small space bounds

This page was built for publication: Stochasticity of the languages acceptable by two-way finite probabilistic automata