Relationships between nondeterministic and deterministic tape complexities (Q2537313): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55879839, #quickstatements; #temporary_batch_1703701571791
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:50, 3 February 2024

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