The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the equivalence-checking problem for a model of programs related with multi-tape automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
A number of decision problems that are unsolvable in general are solvable when restricted to systems with sufficiently simple "loop structure". Examples of such problems are the equivalence problems for flowchart schemata with nonintersecting loops and for the LOOP(l) programs of Meyer and Ritchie. We here present a theorem that gives a unifying view of the solvability of both of these problems, and also of a variety of other old and new solvable decision problems in automata theory, schematology, and logic.