Projections of languages recognizable by probabilistic and alternating finite multitape automata

DOI10.1016/0020-0190(81)90057-0zbMath0491.68050OpenAlexW2073135692MaRDI QIDQ1167542

Rūsiņš Freivalds

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90057-0

zbMATH Keywords

formal languagesalternationprobabilistic automatathree tapestwo tapes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes ⋮ On the power of randomized multicounter machines ⋮ On probabilistic pushdown automata

Cites Work

• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item