Efficient recognition of completeness of systems of automaton functions with complete Boolean part (Q4809609)

From MaRDI portal
Revision as of 08:50, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2095536
Language Label Description Also known as
English
Efficient recognition of completeness of systems of automaton functions with complete Boolean part
scientific article; zbMATH DE number 2095536

    Statements

    Efficient recognition of completeness of systems of automaton functions with complete Boolean part (English)
    0 references
    30 August 2004
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references