Comparative complexity of the representation of languages by probabilistic automata

DOI10.1007/BF01069985zbMath0796.68156OpenAlexW2073107916MaRDI QIDQ4007315

Farid M. Ablayev

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01069985

zbMATH Keywords

probabilistic automatarepresentation of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• The time-precision tradeoff problem on on-line probabilistic Turing machines
• Probabilistic automata

This page was built for publication: Comparative complexity of the representation of languages by probabilistic automata