2 search results - page 1 / 1 » Classifying Regular Languages via Cascade Products of Automa... |
LATA
2011
Springer
12 years 10 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...
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...