Year-end Sale % OFF 
Abstract
We introduce a new class of tree automata, which we call Reduction Automata (RA), and we use it to prove the decidability of the whole first order of theory of reduction (the theory of reduction is the set of true sentences built up with unary predicates red t ( x) " x is reducible by t", i.e. "some instance of t is a subterm of x"). So we link rewriting, logic and formal languages.
Published Version
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.
