Index Terms
(auto-classified)Microprogram/finite automata
Recommendations
Oblivious two-way finite automata: Decidability and complexity
We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs ...
Finite dp automata versus multi-head finite automata
CMC'11: Proceedings of the 12th international conference on Membrane ComputingWe describe a connection between dP automata (distributed P automata) and non-deterministic multi-head finite automata. We introduce the concepts of <em>agreement languages</em> of dP automata, and the notion of a <em>two-way</em> dP automaton. We ...






Comments