Sciweavers

6 search results - page 1 / 2
» Hierarchies of Piecewise Testable Languages
Sort
View
DLT
2008
14 years 10 days ago
Hierarchies of Piecewise Testable Languages
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...
Ondrej Klíma, Libor Polák
LICS
2008
IEEE
14 years 5 months ago
Piecewise Testable Tree Languages
— 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,...
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
VL
2007
IEEE
157views Visual Languages» more  VL 2007»
14 years 5 months ago
Spider Diagrams of Order
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...
Aidan Delaney, Gem Stapleton
LATA
2011
Springer
13 years 1 months ago
Classifying Regular Languages via Cascade Products of Automata
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...
Marcus Gelderie
ACL
2010
13 years 9 months ago
Estimating Strictly Piecewise Distributions
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...
Jeffrey Heinz, James Rogers