One way multihead deterministic finite automata
From MaRDI portal
Publication:1836312
DOI10.1007/BF00290734zbMath0504.68049OpenAlexW1999721795MaRDI QIDQ1836312
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00290734
closure propertiesfamily of languages recognized by one-way k head deterministic finite state automata
Related Items (13)
One-way reversible multi-head finite automata ⋮ Deterministic versus nondeterministic space in terms of synchronized alternating machines ⋮ Prediction of infinite words with automata ⋮ Hierarchies of one-way multihead automata languages ⋮ Tradeoffs for language recognition on alternating machines ⋮ Multihead one-way finite automata ⋮ Stack versus sensitivity for one-way automata ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Unnamed Item ⋮ Deterministic two-way one-head pushdown automata are very powerful ⋮ Unnamed Item ⋮ On the power of alternation in automata theory ⋮ Separation of deterministic, nondeterministic and alternating complexity classes
Cites Work
This page was built for publication: One way multihead deterministic finite automata
