Computability of Recursive Functions
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
Finite automata and their decision problems
IBM Journal of Research and Development
On formalised computer programs
Journal of Computer and System Sciences
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Program equivalence and context-free grammars
Journal of Computer and System Sciences
The computational complexity of program schemata
Journal of Computer and System Sciences
Effective proper procedures and universal classes of program schemata
Journal of Computer and System Sciences
Translatability of schemas over restricted interpretations
Journal of Computer and System Sciences
Semantics of higher-order recursion schemes
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
On the power of programming features
Computer Languages
Survey: A survey of state vectors
Computer Science Review
Hi-index | 0.00 |
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.