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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brzozowski, J.A., Fich, F.E.: Languages of J-trivial monoids. Journal of Computer and System Sciences 20(1), 32–49 (1980)
Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. Journal of Computer and System Sciences 5(1), 1–16 (1971)
Eilenberg, S.: Automata, Languages, and Machines. Pure and Applied Mathematics, vol. A. Elsevier, Burlington (1974)
Eilenberg, S.: Automata, Languages, and Machines. Pure and Applied Mathematics, vol. B. Elsevier, Burlington (1974)
Gelderie, M.: Classifying regular languages via cascade products of automata. Diploma thesis, RWTH Aachen University (2011)
Ginzburg, A.: Algebraic Theory of Automata. Academic Press, New York (1968)
Krohn, K., Rhodes, J.: Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116, 450–464 (1965)
Meyer, A.R.: A note on star-free events. J. ACM 16(2), 220–225 (1969)
Pin, J.E.: Varieties Of Formal Languages. Plenum Publishing Co., New York (1986)
Pin, J.E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. 1, pp. 679–746. Springer-Verlag New York, Inc., New York (1997)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8(2), 190–194 (1965)
Simon, I.: Piecewise testable events. In: Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, pp. 214–222. Springer, London (1975)
Straubing, H.: On finite J-trivial monoids. Semigroup Forum 19, 107–110 (1980)
Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser Verlag, Basel (1994)
Straubing, H., Thérien, D.: Partially ordered finite monoids and a theorem of I. Simon. J. Algebra 119(2), 393–399 (1988)
Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25(3), 360–376 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelderie, M. (2011). Classifying Regular Languages via Cascade Products of Automata. In: Dediu, AH., Inenaga, S., MartÃn-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-21254-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21253-6
Online ISBN: 978-3-642-21254-3
eBook Packages: Computer ScienceComputer Science (R0)