2 search results - page 1 / 1 » lata 2011 |
LATA
2011
Springer
12 years 7 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...
LATA
2011
Springer
12 years 7 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...