Abstract:
The article is concerned with design of a certain class of moniorable automata with specified constraints on the expansion degree of the input and output alphabets and the set of states; the upper bound is obtained for the length of the control sequence of the automaton being designed.
Fulltext:
PDF file (1291 kB)