Radu Gramatovici
Bounded Deterministic Go-Through Automata

Abstract.
We extend here the results from [3] for a new class of automata called go-through automata, in the deterministic version, while using a bounded auxiliary memory. The goal is to compare the descriptional complexity of finite languages implemented by bounded deterministic go-through automata, with the descriptional complexity of the same class of languages implemented by bounded deterministic push-down automata, deterministic finite automata or deterministic finite cover-automata.