The Invariance Problem for Matrix Semigroups (Q2811359): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Reachability in Register Machines with Polynomial Updates / 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: On the reachability problem for 5-dimensional vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for the orbit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Problems for PAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank

Latest revision as of 03:03, 12 July 2024

scientific article
Language Label Description Also known as
English
The Invariance Problem for Matrix Semigroups
scientific article

    Statements

    Identifiers

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