1. R. Danecki, Propositional Dynamic Logic with strong loop predicate, Proc. MFCS'84, LNCS 176, 573–581 (1984) Springer-Verlag
2. M. J. Fisher, R. E. Ladner, Propositional Dynamic Logic of regular programs, JCSS 18:2, (1979), 194–211
3. D. Harel, Recurring dominoes: Making the highly undecidable highly understandable, Proc. FCT'83, LNCS 158, 177–194, (1983) Springer-Verlag
4. M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. AMS 141 (1969), 1–35
5. M. O. Rabin, Weakly definable relations and special automata, in: Math. Logic and Found. of Set Theory (Y. Bar-Hillel ed.) North-Holland (1970), 1–23