A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Classifying Regular Languages via Cascade Products of Automata
[chapter]
2011
Lecture Notes in Computer Science
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 classes. More precisely we provide characterizations for the classes of piecewise testable languages and commutative languages. To this end we use biased resets, which are resets in the classical sense, that can change their state at most once. Next, we introduce the concept of the scope of a cascade product of reset automata in
doi:10.1007/978-3-642-21254-3_22
fatcat:ut5xnkhm4faidmrawqpp5aerjq