6 search results - page 1 / 2 » Hierarchies of Piecewise Testable Languages |
88
Voted
DLT
2008
15 years 1 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...
LICS
2008
IEEE
15 years 6 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,...
97
Voted
VL
2007
IEEE
15 years 5 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...
151
click to vote
LATA
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
ACL
2010
14 years 9 months ago
2010
Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classe...