Maximum subclasses in classes of linear automata over finite fields
Diskretnaya Matematika, Tome 31 (2019) no. 4, pp. 88-101

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{DM_2019_31_4_a5,
     author = {A. A. Chasovskikh},
     title = {Maximum subclasses in classes of linear automata over finite fields},
     journal = {Diskretnaya Matematika},
     pages = {88--101},
     publisher = {mathdoc},
     volume = {31},
     number = {4},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2019_31_4_a5/}
}
TY  - JOUR
AU  - A. A. Chasovskikh
TI  - Maximum subclasses in classes of linear automata over finite fields
JO  - Diskretnaya Matematika
PY  - 2019
SP  - 88
EP  - 101
VL  - 31
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2019_31_4_a5/
LA  - ru
ID  - DM_2019_31_4_a5
ER  - 
%0 Journal Article
%A A. A. Chasovskikh
%T Maximum subclasses in classes of linear automata over finite fields
%J Diskretnaya Matematika
%D 2019
%P 88-101
%V 31
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2019_31_4_a5/
%G ru
%F DM_2019_31_4_a5
A. A. Chasovskikh. Maximum subclasses in classes of linear automata over finite fields. Diskretnaya Matematika, Tome 31 (2019) no. 4, pp. 88-101. http://geodesic.mathdoc.fr/item/DM_2019_31_4_a5/