Some problems related to the class of program schemata introduced by R. M. Karp and R. M. Miller in paper [1] are solved in this paper. The method of the proof implemented in the paper allows us to obtain a negative solution of the existence problem of an algorithm for equivalence recognition for a
✦ LIBER ✦
Equivalence of free program schemata
✍ Scribed by V. É. Itkin
- Book ID
- 105117953
- Publisher
- Springer US
- Year
- 1978
- Tongue
- English
- Weight
- 1009 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On program schemata equivalence
✍
V.E. Itkin; V.E. Itkin; Z. Zwinogrodzki
📂
Article
📅
1972
🏛
Elsevier Science
🌐
English
⚖ 584 KB
Problems of inclusion and equivalence fo
✍
L. P. Lisovik
📂
Article
📅
1993
🏛
Springer US
🌐
English
⚖ 750 KB
Equivalence of conservative, free, linea
✍
Michael R. Laurence; Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 312 KB
A program schema deÿnes a class of programs, all of which have identical statement structures, but whose expressions may di er. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.
Program schemata vs. automata for decida
✍
N.V. Shilov
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 922 KB
A new technique for decidability of program logics is introduced. This technique is applied to the most expressive propositional program logic -mu-calculus. 0. Introduction We would like to present program scheme technique (PST) for decidability of program and polymodal propositional logics. This te
Complexity of derivation of equivalent Y
✍
O. N. Ochakovskaya
📂
Article
📅
1976
🏛
Springer US
🌐
English
⚖ 698 KB
Parameter-free convex equivalent and dua
✍
S. Schaible
📂
Article
📅
1974
🏛
Springer
🌐
English
⚖ 426 KB