Completeness problem for the class of linear automata functions

DOI10.1515/dma-2016-0007zbMath1386.68087OpenAlexW2528358828MaRDI QIDQ314183

Anatoliy A. Chasovskikh

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0007

zbMATH Keywords

delayfeedbacksuperposition operationfinite automatoncompleteness criterionaddercompleteness problemcomposition operationlinear automata functionprecomplete classes

Mathematics Subject Classification ID

Related Items (3)

Completeness problem for the class of linear automata functions ⋮ Maximum subclasses in classes of linear automata over finite fields ⋮ Conditions of a-completeness for linear automata over dyadic rationals

Cites Work

• Completeness problem for the class of linear automata functions
• On closed classes of quasilinear functions
• Function Algebras on Finite Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness problem for the class of linear automata functions