Makanin's algorithm for solving word equations with regular constraints

dc.contributor.authorDiekert, Volkerde
dc.date.accessioned1999-06-15de
dc.date.accessioned2016-03-31T07:58:08Z
dc.date.available1999-06-15de
dc.date.available2016-03-31T07:58:08Z
dc.date.issued1998de
dc.date.updated2013-06-19de
dc.description.abstractWe 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.en
dc.identifier.other074006231de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-4200de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/2436
dc.identifier.urihttp://dx.doi.org/10.18419/opus-2419
dc.language.isoende
dc.relation.ispartofseriesTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;1998,2de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.classificationConstraint <Künstliche Intelligenz> , Constraint-logische Programmierungde
dc.subject.ddc004de
dc.titleMakanin's algorithm for solving word equations with regular constraintsen
dc.typeworkingPaperde
ubs.fakultaetFakultät Informatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Formale Methoden der Informatikde
ubs.opusid420de
ubs.publikation.typArbeitspapierde
ubs.schriftenreihe.nameTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnikde

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
420_1.pdf
Size:
393.95 KB
Format:
Adobe Portable Document Format