On Post correspondence problem for letter monotonic languages (Q2271434): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62045938, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5796052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolvability in 3 × 3 Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank

Latest revision as of 20:25, 1 July 2024

scientific article
Language Label Description Also known as
English
On Post correspondence problem for letter monotonic languages
scientific article

    Statements

    On Post correspondence problem for letter monotonic languages (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2009
    0 references
    Post correspondence problem
    0 references
    decidability
    0 references
    word equation
    0 references

    Identifiers