Relationships between nondeterministic and deterministic tape complexities (Q2537313)

From MaRDI portal
Revision as of 19:33, 27 December 2023 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55879839, #quickstatements; #temporary_batch_1703701571791)
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