Piecewise testable tree languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2012

Piecewise testable tree languages


This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ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 Σ1 sentences if and only if its syntactic monoid is J-trivial.
Fichier principal
Vignette du fichier
simon.pdf (434.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01160458 , version 1 (05-06-2015)


  • HAL Id : hal-01160458 , version 1


Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing. Piecewise testable tree languages. Logical Methods in Computer Science, 2012, 8 (3), pp.29. ⟨hal-01160458⟩
175 View
104 Download


Gmail Facebook X LinkedIn More