On some decision questions concerning pushdown machines (Q593781): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results about regular and pushdown translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes some language theory problems undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A-transducers and the monotonicity of IL schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability results for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of equivalence for deterministic stateless pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank

Latest revision as of 11:02, 14 June 2024

scientific article
Language Label Description Also known as
English
On some decision questions concerning pushdown machines
scientific article

    Statements

    On some decision questions concerning pushdown machines (English)
    0 references
    0 references
    1983
    0 references
    0 references
    equivalence
    0 references
    pushdown transducers
    0 references
    pushdown acceptors
    0 references
    ambiguity
    0 references
    finite- turn nondeterministic counter automaton
    0 references
    1-turn deterministic pushdown automaton
    0 references
    unrestricted deterministic counter automaton
    0 references
    0 references