| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428378 | Information Processing Letters | 2006 | 4 Pages |
Abstract
This paper compares propositional dynamic logic of non-regular programs and fixpoint logic with chop. It identifies a fragment of the latter which is equi-expressive to the former. This relationship transfers several decidability and complexity results between the two logics.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
