Piecewise testable tree languages
Formal Languages and Automata Theory
2015-07-01 v2
Abstract
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_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 Sigma_1 sentences if and only if its syntactic monoid is J-trivial.
Keywords
Cite
@article{arxiv.1208.5129,
title = {Piecewise testable tree languages},
author = {Mikołaj Bojańczyk and Luc Segoufin and Howard Straubing},
journal= {arXiv preprint arXiv:1208.5129},
year = {2015}
}