Decidable Properties of Monadic Functional Schemas

Authors:
Edward Ashcroft;Zohar Manna;Amir Pnueli
Affiliations:
Computer Science Department, University of Waterloo, Waterloo, Ontario, Canada;Applied Mathematics Department, The Weizmann Institute of Science, Rehovot, Israel and Stanford University, Stanford, California;Applied Mathematics Department, The Weizmann Institute of Science, Rehovot, Israel
Venue:
Journal of the ACM (JACM)
Year:
1973

Citing 2
Cited 11

On Ianov's Program Schemata

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata

Method schemas

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

Journal of the ACM (JACM)
Deterministic parsing of ambiguous grammars

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the decision problems of program schemas with commutative and invertible functions

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient algorithms for structural similarity of grammars

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Degrees of translatability and canonical forms in program schemas: Part I

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Computational parallels between the regular and context-free languages

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the completeness of the inductive assertion method

Journal of Computer and System Sciences
Program equivalence and context-free grammars

Journal of Computer and System Sciences
Program equivalence checking by two-tape automata

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of (monadic) functional schemas which properly includes “Ianov” flowchart schemas is defined. It is shown that the termination, divergence, and freedom problems for functional schemas are decidable. Although it is possible to translate a large class of non-free functional schemas into equivalent free functional schemas, it is shown that in general this cannot be done. It is also shown that the equivalence problem for free functional schemas is decidable. Most of the results are obtained from well-known results in formal languages and automata theory.