On completeness in the linear automata class

Chasovskikh A.A.

Abstract:

All precomplete classes are found in the class of linear automata whose set is a reduced criterial system. An algorithm for checking the completeness of finite sets in this class is obtained.

Keywords:

finite automaton, linear automaton, composition operations, completeness, precomplete class, adder, delay

Publication language: russian, pages: 27 (p. 140-166)

Research direction:

Mathematical problems and theory of numerical methods

Russian source text:

Chasovskikh Anatolii Aleksandrovich, , Московский государственный университет имени М. В. Ломоносова, Механико-математический факультет, кафедра Математической теории интеллектуальных систем