An algebraic characterization of frontier testable tree languages
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Two-way unary temporal logic over trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A new algorithm for testing if a regular language is locally threshold testable
Information Processing Letters
Piecewise Testable Tree Languages
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Characterization of Logics over Ranked Tree Languages
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A regular tree language L is locally testable if the membership of a tree into L depends only on the presence or absence of some neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable.