Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1983: Foundations of Computation Theory pp 496–504Cite as

Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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 

  3. Harel, D., First-order Dynamic Logic, Lecture Notes in Comp.Sci. vol.68, Springer Verlag, Berlin,1979.

    Google Scholar 

  4. Stolboushkin,A.P., private letter.

    Google Scholar 

  5. 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 

  6. Urzyczyn,P., Non-trivial definability by iterative and recursive programs, to appear in Information and Control.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw PKiN, 00-901, Warszawa, Poland

    Paweł Urzyczyn

Authors
  1. Paweł Urzyczyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Urzyczyn, P. (1983). Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_130

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_130

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation