Automata with sensing heads

Authors:
Affiliations:
Venue:
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Year:
1995

Citing 0
Cited 3

On the descriptional power of heads, counters, and pebbles

Theoretical Computer Science - Descriptional complexity of formal systems
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science
Automata with modulo counters and nondeterministic counter bounds

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.03

Visualization

Abstract

Abstract: Automata that can detect coincidence of heads (sensing heads) are investigated. It is shown that several types of storage can be used for simulating sensing heads with ordinary heads. Then a general technique for separating automata with an increasing number of sensing heads on unary input alphabets is presented. Finite automata with sensing heads, pebble automata, and bounded counter automata are compared. On unary input pebble automata and finite sensing head automata are equivalent which implies a hierarchy of languages accepted by automata with an increasing number of pebbles. Finally decision problems for one-way finite sensing head automata on unary input alphabets are classified.