One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata

DOI10.1007/978-3-642-40164-0_7zbMath1351.68133OpenAlexW160148895MaRDI QIDQ2842771

Kaspars Balodis

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_7

Mathematics Subject Classification ID

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

Related Items (2)

Counting with Probabilistic and Ultrametric Finite Automata ⋮ New size hierarchies for two way automata

This page was built for publication: One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata