This article is cited 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.

UDC: 519.712

Received: 14.02.2010

DOI: 10.4213/mzm8783

 English version: Mathematical Notes, 2012, 91:5, 625–629

Bibliographic databases:

• 
• 
• 
• 
•