Completeness problem for the class of linear automata functions
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3976344 (Why is no real title available?)
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- scientific article; zbMATH DE number 3196341 (Why is no real title available?)
- Algebra. Transl. from the German by A. A. Bel'skij. Edited by Yu. I. Merzlyakov
- Completeness problem for the class of linear automata functions
- Function Algebras on Finite Sets
- On closed classes of quasilinear functions
Cited in
(7)- Conditions of a-completeness for linear automata over dyadic rationals
- On Slupecki classes for automaton functions
- scientific article; zbMATH DE number 3898772 (Why is no real title available?)
- Completeness problem for the class of linear automata functions
- scientific article; zbMATH DE number 468641 (Why is no real title available?)
- scientific article; zbMATH DE number 3988715 (Why is no real title available?)
- Maximum subclasses in classes of linear automata over finite fields
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)
