Complexity of probabilistic versus deterministic automata

DOI10.1007/BFb0019368zbMath1412.68129MaRDI QIDQ4560366

Rūsiņš Freivalds

Publication date: 11 December 2018

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

zbMATH Keywords

regular languagefinite automatonTuring machinememory elementinput word

Mathematics Subject Classification ID

Related Items (6)

Multiple Usage of Random Bits in Finite Automata ⋮ Ultrametric Algorithms and Automata ⋮ A new family of nonstochastic languages ⋮ Decreasing the bandwidth of a transition matrix ⋮ Multihead two-way probabilistic finite automata ⋮ Multihead two-way probabilistic finite automata

Cites Work

• Alternating Pushdown and Stack Automata
• Some aspects of probabilistic automata
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of probabilistic versus deterministic automata