Geodesic
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/

[1] Babin D. N., “Algoritm polnoty sistem avtomatnykh funktsii s polnoi bulevoi chastyu”, Intellektualnye sistemy, 7:1–4 (2003), 199–222

[2] van der Waerden B. L., Algebra, Frederick Ungar Publishing, New York, 1970 | MR | MR

[3] Gill A., Linear Sequential Circuits. Analysis, Synthesis and Applications, McGraw-Hill, N.Y., 1966, 216 pp. | MR | Zbl

[4] Kudryavtsev V. B., “O moschnosti mnozhestv predpolnykh mnozhestv nekotorykh funktsionalnykh sistem, svyazannykh s avtomatami”, Problemy kibernetiki, 1965, no. 13, 45–74

[5] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, M., 1985, 320 pp. | MR

[6] Lang S., Algebra, Addison-Wesley Pub. Co., 1965, 508 pp. | MR | Zbl

[7] Lidl R., Niderraiter G., Konechnye polya, V 2 t., v. 1, Mir, M., 1988 ; Lidl R., Niederreiter H., Finite Fields, Addison-Wesley Publ. Inc., 1983 | MR | MR | Zbl

[8] Chasovskikh A. A., “Completeness problem for the class of linear automata functions”, Discrete Math. Appl., 26:2 (2016), 89–104 | DOI | DOI | MR | Zbl

[9] Chasovskikh A. A., “Usloviya polnoty lineino-$p$-avtomatnykh funktsii”, Intellektualnye sistemy. Teoriya i prilozheniya, 18:3 (2014), 203–252 | MR