Completeness problem for the class of linear automata functions
From MaRDI portal
Publication:314183
DOI10.1515/DMA-2016-0007zbMATH Open1386.68087OpenAlexW2528358828MaRDI QIDQ314183FDOQ314183
Authors: 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
Recommendations
- scientific article; zbMATH DE number 3988715
- scientific article; zbMATH DE number 468641
- On decidability of the completeness problem for special systems of automaton functions
- Undecidability of the completeness and A-completeness problems for some systems of automaton functions
- Maximum subclasses in classes of linear automata over finite fields
delayfeedbackcompleteness criterionaddercompleteness problemcomposition operationfinite automatonlinear automata functionprecomplete classessuperposition operation
Cites Work
- Function Algebras on Finite Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebra. Transl. from the German by A. A. Bel'skij. Edited by Yu. I. Merzlyakov
- Completeness problem for the class of linear automata functions
- On closed classes of quasilinear functions
Cited In (7)
- Title not available (Why is that?)
- Maximum subclasses in classes of linear automata over finite fields
- Completeness problem for the class of linear automata functions
- On Slupecki classes for automaton functions
- Conditions of a-completeness for linear automata over dyadic rationals
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Completeness problem for the class of linear automata functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314183)
