On complexity of elementary basis in class of single-place linear automata preserving zero sequence
Abstract:
Estimates are obtained for the number of operations for delay expressibility and neutral element in the case of one-place linear automata, preserving the zero sequence. Estimated degree fractions representing unit and delay, respectively.
