Efficient recognition of completeness of systems of automaton functions with complete Boolean part
From MaRDI portal
Publication:4809609
DOI10.1515/156939203321669564zbMath1088.68630OpenAlexW4234083012MaRDI QIDQ4809609
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Boolean functions (06E30)
Related Items (1)
This page was built for publication: Efficient recognition of completeness of systems of automaton functions with complete Boolean part
