Abstract
For finite monadic string-rewriting systems that are confluent and for finite special string-rewriting systems that are λ -confluent it is shown that the R -class and the L -class of a string can be characterized by a regular set of irreducible strings. It follows that for these systems the relation D is decidable. Actually it is shown that this relation is decidable in polynomial time.
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.
