|
Externally periodic automata
A. V. Babash
Abstract:
We describe the automata which transfer any periodic input sequence into a periodic
output sequence. We suggest an algorithm for checking whether a given automaton has this
property and give upper bounds for the complexity of the algorithm.
Received: 05.06.2003
Citation:
A. V. Babash, “Externally periodic automata”, Diskr. Mat., 17:1 (2005), 68–72; Discrete Math. Appl., 15:1 (2005), 59–62
Linking options:
https://www.mathnet.ru/eng/dm88https://doi.org/10.4213/dm88 https://www.mathnet.ru/eng/dm/v17/i1/p68
|
Statistics & downloads: |
Abstract page: | 414 | Full-text PDF : | 245 | References: | 58 | First page: | 1 |
|