Abstract
We show that AI-matching (AI denotes the theory of an<br />associative and idempotent function symbol), which is solving matching<br />word equations in free idempotent semigroups, is NP-complete.<br />Note: this is a full version of the paper [9] and a revision of [8].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
