Geodesic
Periods of output sequences of an automaton for a~given periodic input sequence
Diskretnaya Matematika, Tome 21 (2009) no. 4, pp. 39-59.

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

In this research we give lower bounds for periods of output sequences of automata for a given periodic input sequence. 
@article{DM_2009_21_4_a3,
     author = {A. V. Babash},
     title = {Periods of output sequences of an automaton for a~given periodic input sequence},
     journal = {Diskretnaya Matematika},
     pages = {39--59},
     publisher = {mathdoc},
     volume = {21},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2009_21_4_a3/}
}
TY  - JOUR
AU  - A. V. Babash
TI  - Periods of output sequences of an automaton for a~given periodic input sequence
JO  - Diskretnaya Matematika
PY  - 2009
SP  - 39
EP  - 59
VL  - 21
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2009_21_4_a3/
LA  - ru
ID  - DM_2009_21_4_a3
ER  - 
%0 Journal Article
%A A. V. Babash
%T Periods of output sequences of an automaton for a~given periodic input sequence
%J Diskretnaya Matematika
%D 2009
%P 39-59
%V 21
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2009_21_4_a3/
%G ru
%F DM_2009_21_4_a3
A. V. Babash. Periods of output sequences of an automaton for a~given periodic input sequence. Diskretnaya Matematika, Tome 21 (2009) no. 4, pp. 39-59. http://geodesic.mathdoc.fr/item/DM_2009_21_4_a3/

[1] Trakhtenbrot B. A., Barzdin Ya. M., Konechnye avtomaty (povedenie i sintez), Nauka, Moskva, 1970 | MR | Zbl

[2] Burks A. W., Wright J. B., “Theory of logical nets”, Proc. IRE, 41 (1953), 1357–1365 | DOI | MR | Zbl

[3] Kobrinskii N. E., Trakhtenbrot B. A., Vvedenie v teoriyu konechnykh avtomatov, Fizmatgiz, Moskva, 1962

[4] Babash A. V., “O periodichnosti posledovatelnosti sostoyanii avtomata, otvechayuschei ego nachalnomu sostoyaniyu i vkhodnoi periodicheskoi posledovatelnosti”, Diskretnaya matematika, 14:2 (2002), 54–64 | MR | Zbl

[5] Hibbard T. H., “Least upper bounds on minimal terminal state experiments for two classes of sequential machines”, J. Assoc. Comput. Mach., 8 (1961), 601–612 | Zbl

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

[7] Korshunov A. D., “O verkhnei otsenke dlin kratchaishikh odnorodnykh eksperimentov po raspoznavaniyu zaklyuchitelnogo sostoyaniya dlya pochti vsekh avtomatov”, Dokl. AN SSSR, 184 (1969), 28–29

[8] Korshunov A. D., “Ob asimptoticheskikh otsenkakh chisla privedennykh konechnykh avtomatov”, Diskretnyi analiz, 6 (1966), 35–50

[9] Babash A. V., “Isoperiods of output sequences of automata”, Probabilistic Methods in Discrete Mathematics, eds. Kolchin V. F. et al., VSP, Utrecht, 2002, 147–158