New applications of the wreath product of forest algebras∗
Computer Science Department, Boston College, Chestnut Hill, 02467
Accepted: 19 June 2013
We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL; and new examples of languages outside CTL, along with an application to the question of what properties are definable in both CTL and LTL.
Mathematics Subject Classification: 03D05 / 68Q70
Key words: Tree automata / temporal logics / forest algebras
© EDP Sciences 2013