Complexity of probabilistic versus deterministic automata

DOI10.1007/BFB0019368zbMATH Open1412.68129MaRDI QIDQ4560366FDOQ4560366

Rūsiņš Freivalds

Publication date: 11 December 2018

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

zbMATH Keywords

regular languageTuring machinefinite automatonmemory elementinput word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Probabilistic automata
• Alternating Pushdown and Stack Automata
• Some aspects of probabilistic automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560366)