Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DATA-INDEPENDENT AUTOMATA:
Reports tagged with data-independent automata:
TR12-092 | 6th July 2012
Pavol Duris

A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata.

In this paper we deal with one-way multi-head data-independent finite automata. A $k$-head finite automaton $A$ is data-independent, if the position of every head $i$ after step $t$ in the computation on an input $w$ is a function that depends only on the length of the input $w$, on $i$ ... more >>>




ISSN 1433-8092 | Imprint