A regular tree language L is locally testable if membership of a tree in Ldepends only on the presence or absence of some fix set of neighborhoods in thetree. In this paper we show that it is decidable whether a regular treelanguage is locally testable. The decidability is shown for ranked trees andfor unranked unordered trees
Abstract. We show that it is decidable whether a given a regular tree language belongs to the class∆...
International audienceIn this paper, we give a combinatorial description of the languages that are b...
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of defina...
Abstract. A regular tree language L is locally testable if membership of a tree in L depends only on...
International audienceA regular tree language L is locally testable if membership of a tree in L dep...
International audienceThe piecewise testable separability problem asks, given two input languages, w...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
We consider regular languages of labeled trees. We give an effective characterization of the regular...
AbstractKim, McNaughton and McCloskey have produced a polynomial time algorithm in order to test if ...
Strict k-local testability is an important concept in fields like pattern recognition, neural networ...
The piecewise testable separability problem asks, given two input languages, whether there exists a ...
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of defina...
Abstract. We show that it is decidable whether a given a regular tree language belongs to the class∆...
International audienceIn this paper, we give a combinatorial description of the languages that are b...
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of defina...
Abstract. A regular tree language L is locally testable if membership of a tree in L depends only on...
International audienceA regular tree language L is locally testable if membership of a tree in L dep...
International audienceThe piecewise testable separability problem asks, given two input languages, w...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
A classic result in language theory is Medvedev’s theorem for trees, stating that any regular tree l...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
We consider regular languages of labeled trees. We give an effective characterization of the regular...
AbstractKim, McNaughton and McCloskey have produced a polynomial time algorithm in order to test if ...
Strict k-local testability is an important concept in fields like pattern recognition, neural networ...
The piecewise testable separability problem asks, given two input languages, whether there exists a ...
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of defina...
Abstract. We show that it is decidable whether a given a regular tree language belongs to the class∆...
International audienceIn this paper, we give a combinatorial description of the languages that are b...
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of defina...
DOI
Add to ORKG