One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1016/0020-0190(94)00208-g
Copy DOI
Export
Save
Share
Cite Journal: Information Processing Letters |  Publication Date: Mar 1, 1995 |
 Citations: 6 |
Affiliation: University of Kassel
A finite, special, and confluent string-rewriting system S is constructed such that it is undecidable in general whether a word equation is solvable modulo S. Thus, (word) unification modulo S is undecidable.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
