Abstract:
The sets of all maximum subclasses in classes of linear automata over finite fields are found. An algorithm that decides completeness of finite subsets based on maximum subclasses is formulated.
Keywords:finite automaton, linear automaton, operation of composition, feedback, completeness, maximum subclass, finite field.
Fulltext:
PDF file (438 kB)