Completeness problem for the class of linear automata functions.

Autor: Chasovskikh, Anatoliy A.
Předmět:
Zdroj: Discrete Mathematics & Applications; Apr2016, Vol. 26 Issue 2, p89-104, 16p
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index