Geodesic
The structure of degrees of finite automaton transformations of prefix decidable superwords
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2016), pp. 90-95 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We show that the structure of degrees of finite automaton transformations of prefix decidable superwords does not form the upper semilattice.
Mots-clés : finite automaton transformation
Keywords: upper semilattice, superword, prefix decidability. 
@article{IVM_2016_9_a10,
     author = {N. N. Korneeva},
     title = {The structure of degrees of finite automaton transformations of prefix decidable superwords},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {90--95},
     year = {2016},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2016_9_a10/}
}
TY  - JOUR
AU  - N. N. Korneeva
TI  - The structure of degrees of finite automaton transformations of prefix decidable superwords
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2016
SP  - 90
EP  - 95
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/IVM_2016_9_a10/
LA  - ru
ID  - IVM_2016_9_a10
ER  - 
%0 Journal Article
%A N. N. Korneeva
%T The structure of degrees of finite automaton transformations of prefix decidable superwords
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2016
%P 90-95
%N 9
%U http://geodesic.mathdoc.fr/item/IVM_2016_9_a10/
%G ru
%F IVM_2016_9_a10
N. N. Korneeva. The structure of degrees of finite automaton transformations of prefix decidable superwords. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2016), pp. 90-95. http://geodesic.mathdoc.fr/item/IVM_2016_9_a10/

[1] Reina G., “Stepeni avtomatnykh preobrazovanii”, Kiberneticheskii sb., 1977, no. 14, 95–106

[2] Bairasheva V. R., Stepeni avtomatnykh preobrazovanii pochti periodicheskikh sverkhslov i sverkhslov s razreshimoi monadicheskoi teoriei, No 3103-V89, VINITI, Kazan, 1989

[3] Bairasheva V. R., “Strukturnye svoistva avtomatnykh preobrazovanii”, Izv. vuzov. Matem., 1988, no. 7, 34–39 | MR | Zbl

[4] Vyalyi M. N., Rubtsov A. A., “Algoritmicheskaya razreshimost zadach o povedenii avtomatov na sverkhslovakh”, Diskretn. analiz i issledov. operatsii, 19:2 (2012), 3–18 | MR | Zbl

[5] Korneeva N. N., “Avtomatnye preobrazovaniya prefiksno razreshimykh i razreshimykh po Byukhi sverkhslov”, Izv. vuzov. Matem., 2016, no. 7, 55–65