CHARACTERIZATION OF FINITE AUTOMATA BY THE IMAGES AND THE KERNELS OF THEIR TRANSITION FUNCTIONS
Tatsuhiko Saito · WORLD SCIENTIFIC eBooks · 2001
By an automaton $A$, we mean here a3-tuple $(X,A, \\delta) $ , where $X $ is afinite set (the set of states), $A $ is afinite alphabet (the set of inputs) and $\\delta $ is a mapping of $X\\cross A $ into $X $ (the transition function). As usual, $A^{*} $ and $A^{+} $ denotes the ffee monoid and free semigroup gener-