Real-time computations with restricted nondeterminism (Q4197340): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4077448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with restricted memory access / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Simulation of Multihead Tape Units / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of languages and linear-bounded automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Definable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5328169 / rank
 
Normal rank

Latest revision as of 02:36, 13 June 2024

scientific article; zbMATH DE number 3637284
Language Label Description Also known as
English
Real-time computations with restricted nondeterminism
scientific article; zbMATH DE number 3637284

    Statements

    Real-time computations with restricted nondeterminism (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational Complexity
    0 references
    Real-Time Definable Languages
    0 references
    Languages Acceptable By Real-Time Multitape Turing Machines
    0 references