Propositional dynamic logic of looping and converse is elementarily decidable
- 1 July 1982
- journal article
- Published by Elsevier in Information and Control
- Vol. 54 (1-2) , 121-141
- https://doi.org/10.1016/s0019-9958(82)91258-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- First-Order Dynamic LogicLecture Notes in Computer Science, 1979
- Finiteness is mu-ineffableTheoretical Computer Science, 1976
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966