Solving trace equations using lexicographical normal forms (Q4571965): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of the decidability of some problems for regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of two problems on concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inhomogeneous sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the representation of trace monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving trace equations using lexicographical normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some equations in free partially commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makanin's algorithm for word equations-two improvements and a generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank

Latest revision as of 01:29, 16 July 2024

scientific article; zbMATH DE number 6898388
Language Label Description Also known as
English
Solving trace equations using lexicographical normal forms
scientific article; zbMATH DE number 6898388

    Statements

    Identifiers