The complexity properties of probabilistic automata with isolated cut point

DOI10.1016/0304-3975(88)90164-8zbMath0644.68082OpenAlexW2015555890MaRDI QIDQ1102752

Farid M. Ablyv

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90164-8

zbMATH Keywords

error probabilityprobabilistic automatonisolated cut pointrecognition of languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (1)

Concise representations of regular languages by degree and probabilistic finite automata

Cites Work

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

This page was built for publication: The complexity properties of probabilistic automata with isolated cut point