On stateless multihead automata: hierarchies and the emptiness problem

DOI10.1016/J.TCS.2009.09.001zbMath1184.68316OpenAlexW1976643993MaRDI QIDQ844888

Juhani Karhumäki, Alexander Okhotin, Oscar H. Ibarra

Publication date: 5 February 2010

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.001

zbMATH Keywords

stateless automatamultihead automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata ⋮ Automata with Modulo Counters and Nondeterministic Counter Bounds ⋮ Head and state hierarchies for unary multi-head finite automata ⋮ Nanomachine Computing by Quorum Sensing ⋮ New Results on Vector and Homing Vector Automata ⋮ One-Reversal Counter Machines and Multihead Automata: Revisited ⋮ STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES ⋮ Unnamed Item

Cites Work

• Unnamed Item
• ON STATELESS AUTOMATA AND P SYSTEMS
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• k + 1 Heads Are Better than k
• On Multi-Head Finite Automata

This page was built for publication: On stateless multihead automata: hierarchies and the emptiness problem