Matching Modulo Associativity and Idempotency is NP-Complete
DOI:
https://doi.org/10.7146/brics.v7i13.20140Resumé
We show that AI-matching (AI denotes the theory of anassociative and idempotent function symbol), which is solving matching
word equations in free idempotent semigroups, is NP-complete.
Note: this is a full version of the paper [9] and a revision of [8].
Downloads
Publiceret
2000-01-13
Citation/Eksport
Klima, O., & Srba, J. (2000). Matching Modulo Associativity and Idempotency is NP-Complete. BRICS Report Series, 7(13). https://doi.org/10.7146/brics.v7i13.20140
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
