Classifying Regular Languages via Cascade Products of Automata
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 order to capture a notion of locality inside a cascade product and show that there exist constant bounds on the scope for certain classes of languages. Finally we investigate the impact of biased resets in a product of resets on the dot-depth of languages recognized by this product. This investigation allows us to refine an upper bound on the dot-depth of a language, given by Cohen and Brzozowski.
Unable to display preview. Download preview PDF.
- 5.Gelderie, M.: Classifying regular languages via cascade products of automata. Diploma thesis, RWTH Aachen University (2011)Google Scholar
- 12.Simon, I.: Piecewise testable events. In: Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, pp. 214–222. Springer, London (1975)Google Scholar