Abstract
This paper presents general methods for studying the problems of translatability between classes of schemes and equivalence of schemes in a given class. There are four methods: applying the theory of formal languages, programming, measuring the complexity of a computation, and “cutting and pasting”. These methods are used to answer several questions of translatability and equivalence for classes of program schemes, program schemes augmented with counters, and recursively defined schemes. In particular, it is shown that (i) the quasirational recursion schemes are translatable into strongly equivalent program schemes, (ii) monadic recursion schemes are translatable into strongly equivalent program schemes with two counters, (iii) there is a monadic recursion scheme not strongly equivalent to any program scheme with one counter.
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.
