Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import recommendations run Q6534273
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11083-008-9083-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The equivalence problem for finite rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the equivalence problem for finite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the equivalence problem for nonsolvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence modular varieties with small free spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Objects in Certain Varieties of Inverse Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INDECOMPOSABLE VARIETIES OF GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for equational theories of semi-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Combinatorial Strict Inverse Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monoids with sub-log-exponential free spectra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic growth of free spectra of band monoids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word-problem for finite matrix rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of checking identities for finite matrix rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking quasi-identities in a finite semigroup may be computationally hard. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11083-008-9083-7 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Semiring identities of the Brandt monoid / rank
 
Normal rank
Property / Recommended article: Semiring identities of the Brandt monoid / qualifier
 
Similarity Score: 0.7109217
Amount0.7109217
Unit1
Property / Recommended article: Semiring identities of the Brandt monoid / qualifier
 
Property / Recommended article
 
Property / Recommended article: Monoids with sub-log-exponential free spectra. / rank
 
Normal rank
Property / Recommended article: Monoids with sub-log-exponential free spectra. / qualifier
 
Similarity Score: 0.71014774
Amount0.71014774
Unit1
Property / Recommended article: Monoids with sub-log-exponential free spectra. / qualifier
 
Property / Recommended article
 
Property / Recommended article: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / rank
 
Normal rank
Property / Recommended article: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / qualifier
 
Similarity Score: 0.70257545
Amount0.70257545
Unit1
Property / Recommended article: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4286316 / rank
 
Normal rank
Property / Recommended article: Q4286316 / qualifier
 
Similarity Score: 0.6879075
Amount0.6879075
Unit1
Property / Recommended article: Q4286316 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Small overlap monoids. I: The word problem. / rank
 
Normal rank
Property / Recommended article: Small overlap monoids. I: The word problem. / qualifier
 
Similarity Score: 0.6789162
Amount0.6789162
Unit1
Property / Recommended article: Small overlap monoids. I: The word problem. / qualifier
 
Property / Recommended article
 
Property / Recommended article: THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM / rank
 
Normal rank
Property / Recommended article: THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM / qualifier
 
Similarity Score: 0.6612126
Amount0.6612126
Unit1
Property / Recommended article: THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2742355 / rank
 
Normal rank
Property / Recommended article: Q2742355 / qualifier
 
Similarity Score: 0.65038913
Amount0.65038913
Unit1
Property / Recommended article: Q2742355 / qualifier
 
Property / Recommended article
 
Property / Recommended article: THE SUBWORD REVERSING METHOD / rank
 
Normal rank
Property / Recommended article: THE SUBWORD REVERSING METHOD / qualifier
 
Similarity Score: 0.6488452
Amount0.6488452
Unit1
Property / Recommended article: THE SUBWORD REVERSING METHOD / qualifier
 
Property / Recommended article
 
Property / Recommended article: Clones determined by alternating monoids / rank
 
Normal rank
Property / Recommended article: Clones determined by alternating monoids / qualifier
 
Similarity Score: 0.64501804
Amount0.64501804
Unit1
Property / Recommended article: Clones determined by alternating monoids / qualifier
 
Property / Recommended article
 
Property / Recommended article: Presentations of inverse monoids / rank
 
Normal rank
Property / Recommended article: Presentations of inverse monoids / qualifier
 
Similarity Score: 0.6441206
Amount0.6441206
Unit1
Property / Recommended article: Presentations of inverse monoids / qualifier
 

Latest revision as of 20:10, 27 January 2025

scientific article
Language Label Description Also known as
English
Word problem of the Perkins semigroup via directed acyclic graphs.
scientific article

    Statements

    Word problem of the Perkins semigroup via directed acyclic graphs. (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2008
    0 references
    Brandt monoid
    0 references
    word problem
    0 references
    word graphs
    0 references
    computational complexity
    0 references

    Identifiers

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