Some Problems in Automata Theory
Hartmut Ehrig, K.-D. Kiermeier, Hans‐Jörg Kreowski, Wolfgang Kühnel · 1974
In this chapter we want to formulate the problems of equivalence, reduction, minimization and realization as well as some basic notions concerning the transition monoid and the structure theory of automata. In order to give a motivation for the constructions in the following chapters we will sketch the problems and the corresponding results for the case of deterministic automata in such a way that they can be generalized to automata in monoidal categories of deterministic type (cf. 1.12). For a categorical theory of decomposition and synthesis of automata we refer the reader to [18]. Unless otherwise specified automata are always deterministic in this chapter.