Efficient recognition of completeness of systems of automaton functions with complete Boolean part

DOI10.1515/156939203321669564MaRDI QIDQ4809609zbMATH OpenOpenAlexFDO

Authors Dmitriĭ Nikolaevich Babin

Publication date 30 August 2004

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Boolean functions (06E30)

Cited in

(2)

• The completeness criterion for systems which contain all one-place finite-automaton functions
• The completeness problem in the function algebra of linear integer-coefficient polynomials

This page was built for publication: Efficient recognition of completeness of systems of automaton functions with complete Boolean part

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