Tree-size bounded alternation (Q1145502): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(80)90036-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965022641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / 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: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Systems: Constructions, Solutions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to models of synchronous parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the power of vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / 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: On context-free languages and push-down automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the membership problem for some extensions of context-free languagest† / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulation result for the auxiliary pushdown automata / rank
 
Normal rank

Latest revision as of 09:36, 13 June 2024

scientific article
Language Label Description Also known as
English
Tree-size bounded alternation
scientific article

    Statements

    Tree-size bounded alternation (English)
    0 references
    0 references
    1980
    0 references
    tree-size bounded alternation
    0 references
    accepting computation tree
    0 references
    alternating Turing machine
    0 references
    pushdown automata
    0 references
    languages log-space-reducible to context-free languages
    0 references
    context-free language recognition
    0 references

    Identifiers