Some characterizations of multihead finite automata

DOI10.1016/S0019-9958(85)80029-2zbMath0588.68027OpenAlexW2003393373MaRDI QIDQ3716303

Louis E. Rosier, Sam M. Kim, Oscar H. Ibarra

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(85)80029-2

zbMATH Keywords

multihead reversal-bounded pushdown automatamultihead two-way finite automatarestricted checking stack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Some results concerning two-dimensional turing machines and finite automata ⋮ The equivalence of pebbles and sensing heads for finite automata ⋮ The power of two-way deterministic checking stack automata

This page was built for publication: Some characterizations of multihead finite automata