SnS can be modally characterized
From MaRDI portal
Publication:914397
DOI10.1016/0304-3975(90)90140-DzbMath0701.68064MaRDI QIDQ914397
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
concurrent systemstree languagestransitionsmodal mu-calculusRabin's tree theoremsecond-order monadic theory of n successors
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Second- and higher-order model theory (03C85)
Related Items (2)
Cites Work
This page was built for publication: SnS can be modally characterized