A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...
Abstract. We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the...
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In ...