Solving trace equations using lexicographical normal forms

DOI10.1007/3-540-63165-8_190MaRDI QIDQ4571965zbMATH OpenOpenAlexFDO

Authors Volker Diekert, Anca Muscholl, Yu. Matiyasevich

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_190

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Formal languages and automata (68Q45)

Recommendations

• Solving word equations modulo partial commutations
• scientific article; zbMATH DE number 1114346
• Alphabetical satisfiability problem for trace equations
• scientific article; zbMATH DE number 1948486
• scientific article; zbMATH DE number 1754619

Cites work

• A remark on the representation of trace monoids
• Characterizations of the decidability of some problems for regular trace languages
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3577484 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• scientific article; zbMATH DE number 1114346 (Why is no real title available?)
• Inhomogeneous sorting
• Makanin's algorithm for word equations-two improvements and a generalization
• On some equations in free partially commutative monoids
• Solving trace equations using lexicographical normal forms
• The parallel complexity of two problems on concurrency

Cited in

(4)

• Solving word equations modulo partial commutations
• scientific article; zbMATH DE number 1114346 (Why is no real title available?)
• Solving trace equations using lexicographical normal forms
• Recognizing string graphs in NP

This page was built for publication: Solving trace equations using lexicographical normal forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571965)