Q4146255 (Q4146255): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and tape complexity of pushdown automaton languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translational lemmas, polynomial time, and \((\log n)^j\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing complexity classes / 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: An observation on time-storage trade off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-tape and multi-head pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown automata with counters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on computing time for recognition of languages generated by linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded complexity classes and multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General context-free recognition in less than cubic time / rank
 
Normal rank

Latest revision as of 21:41, 12 June 2024

scientific article; zbMATH DE number 3576701
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 3576701

    Statements

    1977
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references