Abstract
Based on a careful analysis of reduction sequences in monadic Thue systems we show that some uniform decision problems, among them the uniform conjugacy problem, are decidable in polynomial time for finite monadic Church-Rosser Thue systems. On the other hand, an example of a decision problem is exhibited that is undecidable even for this class of Thue systems.
Sign-in/Register to access full text options 
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 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.
