Abstract
Based on a polynomial-time test for determining whether a finite special string-rewriting systemR ise-confluent, a procedure for completing a finite special systemR on[e]R is derived. The correctness and completeness of this procedure are proved. In addition, the special case of finite special string-rewriting systems presenting groups is considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: 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.