The exact complexity of the infinite Post Correspondence Problem (Q2345861): 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/j.ipl.2015.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007803218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems for probabilistic automata of fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on deterministic pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets for ω‐languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability problems for infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of infinite post correspondence problem for instances of Size 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 03:25, 10 July 2024

scientific article
Language Label Description Also known as
English
The exact complexity of the infinite Post Correspondence Problem
scientific article

    Statements

    The exact complexity of the infinite Post Correspondence Problem (English)
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    theory of computation
    0 references
    formal languages
    0 references
    computational complexity
    0 references
    decision problems
    0 references
    infinite Post Correspondence Problem
    0 references
    exact complexity
    0 references
    \(\Pi_1^0\)-complete
    0 references
    0 references