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/s0304-3975(98)00123-6
Copy DOI
Export
Save
Share
Cite Journal: Theoretical Computer Science |  Publication Date: Jul 1, 1999 |
 Citations: 2 |  License type: elsevier-specific: oa user license |
Affiliation: University of Michigan–Ann Arbor, Uppsala University
We study the monadic case of a decision problem known as simultaneous rigid E -unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
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.
