Ashok K. Chandra
ABSTRACT
We consider partially interpreted monadic schemas in which some functions are specified to commute, or some function is specified to be invertible. The decision problems considered are those of halting, divergence, equivalence, inclusion and isomorphism. It is shown that with either commutativity or invertibility alone, all these decision problems are solvable, whereas with both commutativity and invertibility, all become unsolvable. These results are also related to the decision problems for finite automata on multi-dimensional infinite tapes.
- Ashcroft, Manna and Pnueli {1973}. E. Ashcroft, Z. Manna and A. Pnueli, "Decidable properties of monadic functional schemas," Journal of the ACM, Vol. 20, No. 2 (April 1973). Google Scholar
Digital Library
- Chandra {1973}. A. K. Chandra, "On the properties and applications of program schemas," Ph.D. Thesis, Report no. CS-336, AIM-188, Computer Science Dept., Stanford University, March 1973. Google ScholarDigital Library
- Chandra and Manna {1973}. A. K. Chandra and Z. Manna, "On the power of programming features," Report no. CS-333, AIM-185, Computer Science Dept., Stanford University, January 1973. Google ScholarDigital Library
- Constable and Gries {1972}. R. L. Constable and D. Gries, "On classes of program schemata," in SIAM Journal on Computing, Vol. 1, No. 1, March 1972, pp. 66-118.Google ScholarCross Ref
- Garland and Luckham {1971}. S. J. Garland and D. C. Luckham, "Program schemes, recursion schemes, and formal languages," UCLA report no. ENG-7154, June 1971.Google Scholar
- Ianov {1958}. Iu Ianov, "The logical schemas of algorithms, "Problems and Cybernetics, Vol. 1, pp. 75-127, (Russian edition).Google Scholar
- Ianov {1960}. Iu Ianov, "The logical schemes of algorithms," English translation in Problems of Cybernetics, Vol. 1, Pergamon Press, New York, 1960, pp. 82-140.Google Scholar
- Luckham, Park and Paterson {1970}. D. C. Luckham, D. M. R. Park and M. S. Paterson, "On formalized computer programs," Journal of Computer and System Sciences, Vol. 4, No. 3, (June 1970) pp. 220-249.Google ScholarDigital Library
- Manna {1969}. Z. Manna, "Properties of programs and the first-order predicate calculus," Journal of the ACM, Vol. 16, No. 2, April 1969 pp. 244-255. Google ScholarDigital Library
- Paterson {1967}. M. S. Paterson, "Equivalence problems in a model of computation," Ph.D. Thesis, University of Cambridge, England (August 1967). Also Artificial Intelligence Memo, No. 1, Mass. Institute of Technology, 1970.Google Scholar
- Paterson and Hewitt {1970}. M. S. Paterson and C. E. Hewitt, "Comparative schematology," in Record of Project MAC Conference on concurrent systems and parallel computation, ACM, New York (December 1970), pp. 119-128.Google Scholar
- On the decision problems of program schemas with commutative and invertible functions
Recommendations
Commutative pseudo-equality algebras
Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvureăźenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the ...
Combination problems for commutative/monoidal theories or how algebra can help in equational unification
We study the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. It encompasses important examples like the theories of Abelian monoids, idempotent Abelian monoids, and Abelian ...
A non-commutative and non-idempotent theory of quantale sets
In fuzzy set theory non-idempotency arises when the conjunction is interpreted by arbitrary t-norms. There are many instances in mathematics where set theory ought to be non-commutative and/or non-idempotent. The purpose of this paper is to combine both ...
Comments