Decidable Properties of Monadic Functional Schemas-Reference-Cited by-同舟云学术

Decidable Properties of Monadic Functional Schemas

Published:1973-07 Issue:3 Volume:20 Page:489-499
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Ashcroft Edward¹,Manna Zohar²,Pnueli Amir³

Affiliation:

1. Computer Science Department, University of Waterloo, Waterloo, Ontario, Canada

2. Applied Mathematics Department, The Weizmann Institute of Science, Rehovot, Israel and Stanford University, Stanford, California

3. Applied Mathematics Department, The Weizmann Institute of Science, Rehovot, Israel

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321765.321780

Reference9 articles.

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Zohar Manna (1939–2018);Formal Aspects of Computing;2019-12

2. Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales;Moscow University Computational Mathematics and Cybernetics;2013-02-27

3. Program equivalence checking by two-tape automata;Cybernetics and Systems Analysis;2010-07

4. The Equivalence Problem for Computational Models: Decidable and Undecidable Cases;Lecture Notes in Computer Science;2001

5. On the Decidability of the Equivalence Problem for Monadic Recursive Programs;RAIRO - Theoretical Informatics and Applications;2000-03