8 search results - page 2 / 2 » Piecewise Testable Tree Languages |
LATA
2011
Springer
12 years 9 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...
JIIS
2008
13 years 6 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
TCS
2002
13 years 6 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...