{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T23:04:24Z","timestamp":1706051064265},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10455,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,12]]},"DOI":"10.1016\/0022-0000(84)90005-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"359-365","source":"Crossref","is-referenced-by-count":9,"title":["Undecidability of PDL with L = {a2i |; i \u2a7e 0}"],"prefix":"10.1016","volume":"29","author":[{"given":"D.","family":"Harel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.S.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90005-9_BIB1","article-title":"The undecidability of the domino problem","volume":"66","author":"Berger","year":"1966","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(84)90005-9_BIB2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90005-9_BIB3","series-title":"Proc. Logic and Computation Conference","article-title":"A simple highly undecidable domino problem (or, A lemma on infinite trees with applications)","author":"Harel","year":"1984"},{"key":"10.1016\/0022-0000(84)90005-9_BIB4","series-title":"Proc. Sympos. on Fundamentals of Computation Theory","first-page":"177","article-title":"Recurring dominoes: Making the highly undecidable highly understandable","author":"Harel","year":"1983"},{"key":"10.1016\/0022-0000(84)90005-9_BIB5","article-title":"Dynamic logic","author":"Harel","year":"1983"},{"key":"10.1016\/0022-0000(84)90005-9_BIB6","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(83)90014-4","article-title":"Propositional dynamic logic of nonregular programs","volume":"26","author":"Harel","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90005-9_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","article-title":"An elementary proof of the completeness of PDL","volume":"14","author":"Kozen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90005-9_BIB8","series-title":"Proc. 17th IEEE Sympos. Found. Comput. Sci.","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0022-0000(84)90005-9_BIB9","series-title":"Proc. 20th IEEE Sympos. Found. Comput. Sci.","first-page":"115","article-title":"Models of program logics","author":"Pratt","year":"1979"},{"key":"10.1016\/0022-0000(84)90005-9_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and Nonperiodicity for Tilings of the Plane","volume":"12","author":"Robinson","year":"1971","journal-title":"Invent. Math."},{"key":"10.1016\/0022-0000(84)90005-9_BIB11","series-title":"Mathematical Theory of Automata","first-page":"23","article-title":"Dominoes and the AEA case of the decision problem","author":"Wang","year":"1963"},{"key":"10.1016\/0022-0000(84)90005-9_BIB12","unstructured":"T. Olshansky and A. Pnueli, There exist decidable context-free propositional dynamic logics, (manuscript)."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900059?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900059?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:57Z","timestamp":1550325117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["0022000084900059"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90005-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}