Completeness problem for the class of linear automata functions
Anatoliy A. Chasovskikh · Discrete Mathematics and Applications · 2016
Abstract We consider the classes of linear automata functions over finite fields with composition (superposition and feedback) operation and describe an algorithm that decides whether a finite set of functions from such class is complete. Thus we generalize the result that was known for the case of linear automata functions over prime finite fields.