Abstract
Rewrite systems are directed equations used to compute by repeatedly replacing subterms of a given formula with equal terms until the simplest form possible is obtained. This simplest form is what we call a normal form. The theory of rewriting is in essence a theory of normal forms. Most frequently we are interested in ground normal forms (normal forms without any variables). Since we are only looking at ground terms, the set of ground normal forms of a rewrite system R may be viewed as a formal language generated by R.
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.
