Skip to main content
Article
Licensed
Unlicensed Requires Authentication

Minimal verifying tests of functions from the Post classes

Published/Copyright: October 9, 2009
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 3 Issue 3

Published Online: 2009-10-09
Published in Print: 1993

Walter de Gruyter

Articles in the same Issue

  1. Modern enumeration theory of permutations with restricted positions
  2. The asymptotic behaviour of the number of t-minimal coverings of a set
  3. Representations over Zpn of linear recurring sequence of maximal period over GF(p)
  4. On the complexity of computation in finite Abelian, nilpotent and soluble groups
  5. Minimal verifying tests of functions from the Post classes
  6. On the evidence of the memory of automaton in experiments
https://doi.org/10.1515/dma.1993.3.3.321

Articles in the same Issue

  1. Modern enumeration theory of permutations with restricted positions
  2. The asymptotic behaviour of the number of t-minimal coverings of a set
  3. Representations over Zpn of linear recurring sequence of maximal period over GF(p)
  4. On the complexity of computation in finite Abelian, nilpotent and soluble groups
  5. Minimal verifying tests of functions from the Post classes
  6. On the evidence of the memory of automaton in experiments
Downloaded on 19.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/dma.1993.3.3.321/html
Scroll to top button