A criterion for the automata realizable functions to be boundedly deterministic
T I Smyshlyaeva · Discrete Mathematics and Applications · 2013
A criterion for the finiteness of the number of states on an automaton realizing a deterministic function is established. The criterion is formulated in terms of formal power series. This work was supported by the Russian Foundation for Basic Research (project no. 12- 01-00680-a)