Deciding Piecewise Testable Separability for Regular Tree Languages

Jean Goubault-Larrecq, Sylvain Schmitz, Marc Herbstritt
2016 International Colloquium on Automata, Languages and Programming  
The piecewise testable separability problem asks, given two input languages, whether there exists a piecewise testable language that contains the first input language and is disjoint from the second. We prove a general characterisation of piecewise testable separability on languages in a well-quasiorder, in terms of ideals of the ordering. This subsumes the known characterisations in the case of finite words. In the case of finite ranked trees ordered by homeomorphic embedding, we show using
more » ... ective representations for tree ideals that it entails the decidability of piecewise testable separability when the input languages are regular. A final byproduct is a new proof of the decidability of whether an input regular language of ranked trees is piecewise testable, which was first shown in the unranked case by Bojańczyk, Segoufin, and Straubing [Log. Meth. in Comput.
doi:10.4230/lipics.icalp.2016.97 dblp:conf/icalp/Goubault-Larrecq16 fatcat:6kzs33bamfgvlhuor72x7o4nra