On Slupecki classes for automaton functions

DOI10.1515/DMA.1998.8.3.299MaRDI QIDQ4522781zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 4 January 2001

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

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

zbMATH Keywords

Boolean functionscontinualfinite-automaton functionshypercontinualSlupecki classes

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Functional aspects of the completeness problem for some classes of automaton functions
• Some properties of \(P\)-sets of finite-automaton functions
• On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
• Completeness problem for the class of linear automata functions
• scientific article; zbMATH DE number 4064963

Cited in

(3)

• On the cardinality of the family of precomplete classes in \(P_{E}\)
• Some properties of \(P\)-sets of finite-automaton functions
• Functional aspects of the completeness problem for some classes of automaton functions

This page was built for publication: On Slupecki classes for automaton functions

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