Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs
We show an example of an algebra T, such that every deterministic regular /flow-chart/ program is equivalent in T to a loop-free approximation of itself, while a program augmented by one binary push-down store is not equivalent in T to any loop-free program. From this we deduce that the Deterministic Dynamic Logic of regular programs is strictly weaker than the Deterministic Context-Free Dynamic Logic.
KeywordsRecursive Call Dynamic Logic Empty Word Program Term Regular Program
Unable to display preview. Download preview PDF.
- [BHT]Berman, P.,Halpern, J.Y.,Tiuryn, J., On the power of nondeterminism in Dynamic Logic, in: Proc. of 9th ICALP,/M. Nielsen and E.M. Schmidt,eds./,Lecture Notes in Comp.Sci., vol. 140, Springer Verlag, Berlin, 1982, 48–60.Google Scholar
- [E]Erimbetov,M.M., Model-theoretic properties of languages of algorithmic logics /in Russian/, in:"Teorija modelej i ee primenenija", University of Alma-Ata, 1980.Google Scholar
- [H]Harel, D., First-order Dynamic Logic, Lecture Notes in Comp.Sci. vol.68, Springer Verlag, Berlin,1979.Google Scholar
- [S]Stolboushkin,A.P., private letter.Google Scholar
- [T]Tiuryn,J., Unbounded program memory adds to the expressive power of first-order Dynamic Logic, in: Proc. of 22nd IEEE Symp. on FOCS, 1981.Google Scholar
- [U]Urzyczyn,P., Non-trivial definability by iterative and recursive programs, to appear in Information and Control.Google Scholar