A decidable characterization of locally testable tree languages
Formal Languages and Automata Theory
2015-07-01 v2
Abstract
A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable. The decidability is shown for ranked trees and for unranked unordered trees.
Cite
@article{arxiv.1109.5851,
title = {A decidable characterization of locally testable tree languages},
author = {Thomas Place and Luc Segoufin},
journal= {arXiv preprint arXiv:1109.5851},
year = {2015}
}