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
This thesis presents an investigation into the properties of various algebras of trees. In particula...
We study the power-set operation on classes of trees and tree algebras. Our main result consists in ...
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] t...
Abstract—We use the recently developed theory of forest algebras to find algebraic characterizations...
We use the recently developed theory of forest algebras to find algebraiccharacterizations of the la...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
AbstractWe associate a modal operator with each language belonging to a given class of regular tree ...
Abstract. We provide a decidable characterization of regular forest languages definable in FO2(<v...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF...
AbstractWe use the cascade product of tree automata to give an algebraic characterization of the exp...
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal langu...
AbstractWe consider several aspects of Wilke’s [T. Wilke, An algebraic characterization of frontier ...
AbstractThis paper studies logical definability of tree languages (sets of finite trees). The logica...
This paper investigates logical aspects of combining linear orders as semantics for modal and tempor...
We investigate a logic of an algebra of trees including the update operation, which expresses that a...
This thesis presents an investigation into the properties of various algebras of trees. In particula...
We study the power-set operation on classes of trees and tree algebras. Our main result consists in ...
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] t...
Abstract—We use the recently developed theory of forest algebras to find algebraic characterizations...
We use the recently developed theory of forest algebras to find algebraiccharacterizations of the la...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
AbstractWe associate a modal operator with each language belonging to a given class of regular tree ...
Abstract. We provide a decidable characterization of regular forest languages definable in FO2(<v...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF...
AbstractWe use the cascade product of tree automata to give an algebraic characterization of the exp...
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal langu...
AbstractWe consider several aspects of Wilke’s [T. Wilke, An algebraic characterization of frontier ...
AbstractThis paper studies logical definability of tree languages (sets of finite trees). The logica...
This paper investigates logical aspects of combining linear orders as semantics for modal and tempor...
We investigate a logic of an algebra of trees including the update operation, which expresses that a...
This thesis presents an investigation into the properties of various algebras of trees. In particula...
We study the power-set operation on classes of trees and tree algebras. Our main result consists in ...
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] t...
DOI
Add to ORKG