An upper bound for transforming self-verifying automata into deterministic ones (Q5425747)

From MaRDI portal
Revision as of 12:07, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5211859
Language Label Description Also known as
English
An upper bound for transforming self-verifying automata into deterministic ones
scientific article; zbMATH DE number 5211859

    Statements

    An upper bound for transforming self-verifying automata into deterministic ones (English)
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    self-verifying nondeterministic automata
    0 references
    descriptional complexity
    0 references
    power set construction
    0 references

    Identifiers