21 search results - page 2 / 5 » A Decidable Characterization of Locally Testable Tree Langua... |
LATA
2011
Springer
12 years 8 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...
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
LATA
2009
Springer
14 years 2 days ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
TCS
2002
13 years 5 months ago
2002
The new Associative Language Description (ALD) model, a combination of locally testable and constituent structure ideas, is proposed, arguing that in practice it equals context-fr...