8 search results - page 1 / 2 » Piecewise Testable Tree Languages |
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
DLT
2008
13 years 11 months ago
2008
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
VL
2007
IEEE
14 years 4 months ago
2007
IEEE
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...