Geodesic
Conditions of A-completeness for linear automata over dyadic rationals
Diskretnaya Matematika, Tome 32 (2020) no. 2, pp. 44-60.

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

We consider the problem of $A$-completeness in the class of linear automata such that the sets of inputs, outputs and states are Cartesian products of dyadic rationals; systems checked for completeness are comprised of a variable finite set and a fixed additional set. We obtain conditions of $A$-completeness in terms of maximal subclasses in the cases when the additional set is the set of all unary automata and when the additional set consists of the adder.
Keywords: finite automata, linear automata, dyadic rationals, $A$-completeness, maximal subclasses. 
@article{DM_2020_32_2_a3,
     author = {D. V. Ronzhin},
     title = {Conditions of {A-completeness} for linear automata over dyadic rationals},
     journal = {Diskretnaya Matematika},
     pages = {44--60},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2020_32_2_a3/}
}
TY  - JOUR
AU  - D. V. Ronzhin
TI  - Conditions of A-completeness for linear automata over dyadic rationals
JO  - Diskretnaya Matematika
PY  - 2020
SP  - 44
EP  - 60
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2020_32_2_a3/
LA  - ru
ID  - DM_2020_32_2_a3
ER  - 
%0 Journal Article
%A D. V. Ronzhin
%T Conditions of A-completeness for linear automata over dyadic rationals
%J Diskretnaya Matematika
%D 2020
%P 44-60
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2020_32_2_a3/
%G ru
%F DM_2020_32_2_a3
D. V. Ronzhin. Conditions of A-completeness for linear automata over dyadic rationals. Diskretnaya Matematika, Tome 32 (2020) no. 2, pp. 44-60. http://geodesic.mathdoc.fr/item/DM_2020_32_2_a3/

[1] Kudryavtsev V.B., Aleshin S.V., Podkolzin A.S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985, 320 pp.

[2] Buevich V.A., “O polnote, $A$-polnote i $t$-polnote v klasse avtomatnykh otobrazhenii”, Intellektualnye sistemy, 10:1-4 (2006), 613–638

[3] Babin D.N., Letunovskii A.A., “O vozmozhnostyakh superpozitsii, pri nalichii v bazise avtomatov fiksirovannoi dobavki iz bulevykh funktsii i zaderzhki”, Intellektualnye sistemy. Teoriya i prilozheniya, 19:3 (2015), 15–22

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

[5] Ronzhin D.V., “Lineinye avtomaty nad polem ratsionalnykh chisel”, Intellektualnye sistemy. Teoriya i prilozheniya, 21:4 (2017), 144–155