Generalized Finite Automata and Transducers
Karel Čulík, Vladimir Valenta · Journal of automata, languages and combinatorics · 1997
We introduce generalized finite automata as language acceptors, and we prove that they are not more powerful than finite automata. Their purpose is to give a more compact description of regular sets. They can be particularly useful for image description and compression. Generalized finite transducers are presented. They are more powerful than finite transducers, however, they still preserve regular sets. We show how (generalized) finite transducers are used to specify image manipulation.