I'm wondering if anyone can direct me to a high-level description of abstract data types built from finite automata. Something akin to data and control structures in conventional programming. Obviously any automaton implementations will be quite different from standard ADT's, but something conceptually similar within finite automata theory. Preferably deterministic automata