Loading...
Please wait, while we are loading the content...
Similar Documents
Makanin's algorithm for solving word equations with regular constraints
| Content Provider | Semantic Scholar |
|---|---|
| Author | Diekert, Volker |
| Copyright Year | 1998 |
| Abstract | We give a self-contained proof of a fundamental result of Makanin (1977), which solves the satisfiability problem of equations with constants over free monoids. Our presentation of Makanin's algorithm is borrows Schulz (1992a), where Makanin's result is extended to the case where solutions are restricted by imposing regular constraints on the variables. This report appears (with minor modifications) as a chapter of the new book of M. Lothaire Algebraic Combinatorics on Words. |
| File Format | PDF HTM / HTML |
| DOI | 10.18419/opus-2419 |
| Alternate Webpage(s) | http://elib.uni-stuttgart.de/bitstream/11682/2436/1/420_1.pdf |
| Alternate Webpage(s) | http://elib.uni-stuttgart.de/opus/volltexte/1999/420/pdf/420_1.pdf |
| Alternate Webpage(s) | https://doi.org/10.18419/opus-2419 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |