Solving word equations modulo partial commutations
From MaRDI portal
Publication:1960424
DOI10.1016/S0304-3975(98)00313-2zbMATH Open0930.68074DBLPjournals/tcs/DiekertMM99WikidataQ56896629 ScholiaQ56896629MaRDI QIDQ1960424FDOQ1960424
Anca Muscholl, Yu. Matiyasevich, Volker Diekert
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial problems of commutation and rearrangements
- Logical definability on infinite traces
- Makanin's algorithm for word equations-two improvements and a generalization
- Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory
- Characterizations of the decidability of some problems for regular trace languages
- On some equations in free partially commutative monoids
- Inhomogeneous sorting
- The parallel complexity of two problems on concurrency
- On equations in free semigroups and groups
- Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
- The expressibility of languages and relations by word equations
- Solving trace equations using lexicographical normal forms
Cited In (7)
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
- WORD EQUATIONS OVER GRAPH PRODUCTS
- Finding all solutions of equations in free groups and monoids with involution
- On systems of equations over free partially commutative groups
- Parabolic and quasiparabolic subgroups of free partially commutative groups.
- Unification modulo lists with reverse relation with certain word equations
- The existential theory of equations with rational constraints in free groups is PSPACE-complete
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Solving via Modular Methods 👍 👎
- Equations on partial words 👍 👎
- Solving word equations 👍 👎
- Equations on Partial Words 👍 👎
- Solving Simultaneous Modular Equations of Low Degree 👍 👎
- Solving Equations on Words with Morphisms and Antimorphisms 👍 👎
- Solving word equations 👍 👎
This page was built for publication: Solving word equations modulo partial commutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960424)
