Geodesic
Periodically externally hereditary permutation automata
Diskretnaya Matematika, Tome 17 (2005) no. 3, pp. 68-79.

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

We suggest an algorithm which checks the following property of a given finite permutational automaton: for any periodic input sequence and any initial state the period of the corresponding output sequence is divided by the period of the input sequence. Estimates of the complexity of such algorithms are given. 
@article{DM_2005_17_3_a6,
     author = {A. V. Babash},
     title = {Periodically externally hereditary permutation automata},
     journal = {Diskretnaya Matematika},
     pages = {68--79},
     publisher = {mathdoc},
     volume = {17},
     number = {3},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_3_a6/}
}
TY  - JOUR
AU  - A. V. Babash
TI  - Periodically externally hereditary permutation automata
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 68
EP  - 79
VL  - 17
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_3_a6/
LA  - ru
ID  - DM_2005_17_3_a6
ER  - 
%0 Journal Article
%A A. V. Babash
%T Periodically externally hereditary permutation automata
%J Diskretnaya Matematika
%D 2005
%P 68-79
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2005_17_3_a6/
%G ru
%F DM_2005_17_3_a6
A. V. Babash. Periodically externally hereditary permutation automata. Diskretnaya Matematika, Tome 17 (2005) no. 3, pp. 68-79. http://geodesic.mathdoc.fr/item/DM_2005_17_3_a6/

[1] Gill A., Vvedenie v teoriyu konechnykh avtomatov, Nauka, Moskva, 1966 | MR | Zbl