Abstract
The paper presents combinatorial criteria for confluence of one-rule trace-rewriting systems. The criteria are based on self-overlaps of traces, which are closely related to the notion of conjugacy of traces, and can be tested in linear time. As a special case, we reobtain the corresponding results for strings.
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.
