Relationships between nondeterministic and deterministic tape complexities (Q2537313)

From MaRDI portal
Revision as of 18:41, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Relationships between nondeterministic and deterministic tape complexities
scientific article

    Statements

    Relationships between nondeterministic and deterministic tape complexities (English)
    0 references
    0 references
    1970
    0 references
    languages, automata, networks
    0 references

    Identifiers