Add to ORKGInternational audienceThis paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Σ1 sentences if and only if its syntactic monoid is J-trivial
An algebraic characterization of the families of tree languages definable by syntactic monoids is pr...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
This paper presents a decidable characterization of tree languages that can be defined by a boolean ...
This paper presents a decidable characterization of tree languages that canbe defined by a boolean c...
International audienceWe study tree languages that can be defined in Δ2. These are tree languages de...
International audienceThe piecewise testable separability problem asks, given two input languages, w...
The piecewise testable separability problem asks, given two input languages, whether there exists a ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
In this thesis we investigate the expressive power of several logics over finite trees. In particula...
AbstractA regular language L over an alphabet A is called piecewise testable if it is a finite Boole...
International audienceA regular tree language L is locally testable if membership of a tree in L dep...
Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways...
Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
An algebraic characterization of the families of tree languages definable by syntactic monoids is pr...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
This paper presents a decidable characterization of tree languages that can be defined by a boolean ...
This paper presents a decidable characterization of tree languages that canbe defined by a boolean c...
International audienceWe study tree languages that can be defined in Δ2. These are tree languages de...
International audienceThe piecewise testable separability problem asks, given two input languages, w...
The piecewise testable separability problem asks, given two input languages, whether there exists a ...
The first part of the thesis concerns problems related to the question: "when can a regular tre...
In this thesis we investigate the expressive power of several logics over finite trees. In particula...
AbstractA regular language L over an alphabet A is called piecewise testable if it is a finite Boole...
International audienceA regular tree language L is locally testable if membership of a tree in L dep...
Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways...
Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
An algebraic characterization of the families of tree languages definable by syntactic monoids is pr...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...