Finite Automata and Isomorphism Types
Bakh Khoussainov, Sasha Rubin · 2000
In this paper we report on some results about finite automata presentable structures, an area of research first proposed in a Khoussainov-Nerode paper in 1995 [1]. The topic of automata presentable structures is new, under development and is on the edge of interactions between automata theory, (universal) algebra, model theory and complexity theory.