|
This article is cited in 1 scientific paper (total in 1 paper)
Automaton Barriers
A. V. Babash Russian State Social University, Moscow
Abstract:
An upper bound for the minimal length of words which can be obtained at the output of an automaton with binary input and output alphabets is improved.
Keywords:
finite automaton, automaton barrier, barrier length, Moore machine, Medvedev automaton, pseudorandom number generator.
Received: 14.02.2010
Citation:
A. V. Babash, “Automaton Barriers”, Mat. Zametki, 91:5 (2012), 667–673; Math. Notes, 91:5 (2012), 625–629
Linking options:
https://www.mathnet.ru/eng/mzm8783https://doi.org/10.4213/mzm8783 https://www.mathnet.ru/eng/mzm/v91/i5/p667
|
Statistics & downloads: |
Abstract page: | 366 | Full-text PDF : | 197 | References: | 52 | First page: | 29 |
|