Senchenko O. Automata presentation by means of defining relations of their behaviour

The dissertation is devoted to an investigation of structural and metric properties of copresentation for completely defined and partial finite initial automata. A minimal so-called canonical copresentation is defined and its structure is considered. A criterion under which a finite binary relation over the input words be a copresentation of given finite completely defined automaton. It is an isomorphism problem solution for finite initial automata without their construction from given copresentation. A relation between the copresentations and the automata bypasses is obtained. A new notion of copresenting system for partial automata is introduced, which is an generalization of the copresentation for complete automata. A minimal copresenting system is found, and its structure is investigated. It is defined necessary and sufficient conditions under which a system be copresenting for any finite automaton.