Rewriting systems and word problems in a free partially commutative monoid (Q1102124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent and Other Types of Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the Church-Rosser property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal serializability of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the preperfectness of Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738586 / rank
 
Normal rank

Latest revision as of 16:04, 18 June 2024

scientific article
Language Label Description Also known as
English
Rewriting systems and word problems in a free partially commutative monoid
scientific article

    Statements

    Rewriting systems and word problems in a free partially commutative monoid (English)
    0 references
    0 references
    0 references
    1987
    0 references
    rewriting systems
    0 references
    free partially commutative monoid
    0 references
    decidable word problem
    0 references
    finite Thue systems
    0 references

    Identifiers

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