Piecewise testable tree languages
Abstract
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma1 sentences if and only if its syntactic monoid is J-trivial.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.