The complexity of decision problems for finite-turn multicounter machines (Q1151753): 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(81)90028-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979876920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the complexity of nondeterministic counter languages / 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: An NP-Complete Number-Theoretic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / 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:06, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of decision problems for finite-turn multicounter machines
scientific article

    Statements

    The complexity of decision problems for finite-turn multicounter machines (English)
    0 references
    0 references
    0 references
    1981
    0 references
    equivalence problem
    0 references
    two-way multicounter machines
    0 references
    containment problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references