Elementariness of a finite set of words is co-NP-complete (Q3484360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4194455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le théorème du defaut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of the equivalence problem for DOL-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la détermination du rang d'une équation dans le monoide libre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136591 / rank
 
Normal rank

Latest revision as of 09:01, 21 June 2024

scientific article
Language Label Description Also known as
English
Elementariness of a finite set of words is co-NP-complete
scientific article

    Statements

    Elementariness of a finite set of words is co-NP-complete (English)
    0 references
    1990
    0 references
    elementariness
    0 references
    rank of a finite set of words
    0 references
    NP-complete
    0 references
    0 references

    Identifiers