Undecidability of PDL with L = {a2i |; i ⩾ 0}
- 2 December 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 29 (3) , 359-365
- https://doi.org/10.1016/0022-0000(84)90005-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Propositional dynamic logic of nonregular programsJournal of Computer and System Sciences, 1983
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Undecidability and nonperiodicity for tilings of the planeInventiones Mathematicae, 1971