ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56095063, #quickstatements; #temporary_batch_1705870497004
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 / cites work
 
Property / cites work: On the membership of invertible diagonal and scalar matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On undecidability bounds for matrix decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability problems in quaternion matrix and rotation semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable and Undecidable Problems about Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundedness of all products of a pair of matrices is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems on integer matrices / 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: Decision problems for semi-Thue systems with a few rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding whether a monoid is a free monoid or is a group / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of free rotation groups / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:52, 3 July 2024

scientific article
Language Label Description Also known as
English
ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
scientific article

    Statements

    ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (English)
    0 references
    0 references
    0 references
    19 January 2011
    0 references
    0 references
    combinatorics on words
    0 references
    group problem
    0 references
    Post's correspondence problem
    0 references
    matrix semigroups
    0 references
    undecidability
    0 references
    0 references