Restricted one-counter machines with undecidable universe problems (Q3864502): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitape one-way nonwriting automata / 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: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / 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: 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 04:24, 13 June 2024

scientific article
Language Label Description Also known as
English
Restricted one-counter machines with undecidable universe problems
scientific article

    Statements

    Restricted one-counter machines with undecidable universe problems (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    undecidable universe problem
    0 references
    subclasses of one-counter machines
    0 references
    restricted nondeterminism
    0 references