Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter May 1, 2003

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

  • D. N. Babin
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/156939203321669564

We consider automaton bases with complete Boolean part. We construct an algorithm to test completeness of such bases and give upper bounds for its complexity.

Published Online: 2003-05-01
Published in Print: 2003-05-01

Copyright 2003, Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 13 Issue 1

Journal and Issue

Articles in the same Issue

Limit theorems for probabilities of large deviations of a Galton–Watson process
On asymptotic complexity of computing discrete logarithms over GF(p)
Synthesis and complexity of reliable circuits over the basis {&, ∨, ¯} in the case of one-type constant faults at the inputs of elements
Efficient recognition of completeness of systems of automaton functions with complete Boolean part
On good pairs in edge-regular graphs
Necessary conditions for a polynomial to be chromatic
Downloaded on 17.5.2024 from https://www.degruyter.com/document/doi/10.1515/156939203321669564/html
Scroll to top button