Undecidability of PDL with L={a^(2i)|i>=0}
暂无分享,去创建一个
[1] D. Harel. Recurring dominoes: making the highly undecidable highly understandable , 1985 .
[2] Vaughan R. Pratt,et al. SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.
[3] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..
[4] Rohit Parikh,et al. An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..
[5] R. Robinson. Undecidability and nonperiodicity for tilings of the plane , 1971 .
[6] Amir Pnueli,et al. Propositional Dynamic Logic of Nonregular Programs , 1983, J. Comput. Syst. Sci..
[7] Vaughan R. Pratt,et al. Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[8] Robert L. Berger. The undecidability of the domino problem , 1966 .
[9] Amir Pnueli,et al. There Exit Decidable Context Free Propositional Dynamic Logics , 1983, Logic of Programs.