Functional aspects of the completeness problem for some classes of automaton functions

DOI10.1515/DMA.2000.10.3.279MaRDI QIDQ4522875zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 16 August 2001

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

Full work available at URL https://doi.org/10.1515/dma.2000.10.3.279

zbMATH Keywords

Boolean functionsfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Slupecki classes for automaton functions
• scientific article; zbMATH DE number 5005932
• Undecidability of the completeness and A-completeness problems for some systems of automaton functions
• scientific article; zbMATH DE number 3898772
• Some properties of \(P\)-sets of finite-automaton functions

Cited in

(10)

• On the cardinality of the family of precomplete classes in \(P_{E}\)
• Problem of checking the functional completeness in the class of piecewise parallel functions
• A completeness theorem in the class of quasimonotonic functions
• scientific article; zbMATH DE number 2125663 (Why is no real title available?)
• Completeness of automaton mappings with respect to equivalence relations
• scientific article; zbMATH DE number 468641 (Why is no real title available?)
• On Slupecki classes for automaton functions
• The completeness criterion for systems which contain all one-place finite-automaton functions
• Functional Completeness in CPL via Correspondence Analysis
• The classes of automata embeddable to pre-complete classes

This page was built for publication: Functional aspects of the completeness problem for some classes of automaton functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522875)