Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (Q2558752): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Approach to a Unified Theory of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack automata and compiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonerasing stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Writing stack acceptors / rank
 
Normal rank

Revision as of 11:32, 12 June 2024

scientific article
Language Label Description Also known as
English
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
scientific article

    Statements

    Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata (English)
    0 references
    0 references
    1971
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references