Fooling a two-way nondeterministic multihead automaton with reversal number restriction
From MaRDI portal
Publication:1058864
zbMath0565.68078MaRDI QIDQ1058864
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (5)
Tradeoffs for language recognition on alternating machines ⋮ Complexity of multi-head finite automata: origins and directions ⋮ Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Fooling a two-way nondeterministic multihead automaton with reversal number restriction
