Abstract
We assign to each positive variety \(\mathcal V\) and each natural number k the class of all (positive) Boolean combinations of the restricted polynomials, i.e. the languages of the form \(L_0a_1 L_1a_2\dots a_\ell L_\ell, \text{ where } \ell\leq k\), a 1,...,a ℓ are letters and L 0,...,L ℓ are languages from the variety \(\mathcal V\). For this polynomial operator we give a certain algebraic counterpart which works with identities satisfied by syntactic (ordered) monoids of languages considered. We also characterize the property that a variety of languages is generated by a finite number of languages. We apply our constructions to particular examples of varieties of languages which are crucial for a certain famous open problem concerning concatenation hierarchies.
2000 Classification: 68Q45 Formal languages and automata.
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.
Similar content being viewed by others
References
Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)
Bloom, S.L.: Varieties of ordered algebras. J. Comput. Syst. Sci. 13(2), 200–212 (1976)
Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, Berlin (1981)
Blanchet-Sadri, F.: Equations and monoids varieties of dot-depth one and two. Theoret. Comput. Sci. 123, 239–258 (1994)
Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, New York (1976)
Klíma, O., Polák, L.: Hierarchies of piecewise testable languages. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 479–490. Springer, Heidelberg (2008)
Pin, J.-E.: A variety theorem without complementation. Russian Mathem (Iz. VUZ) 39, 74–83 (1995)
Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10. Springer, Heidelberg (1997)
Pin, J.-E.: Algebraic tools for the concatenation product. Theoretical Computer Science 292, 317–342 (2003)
Simon, I.: Piecewise testable events. In: ICALP 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Volkov, M.V.: Reflexive relations, extensive transformations and piecewise testable languages of a given height. Int. J. Algebra and Computation 14, 817–827 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klíma, O., Polák, L. (2009). Polynomial Operators on Classes of Regular Languages. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-03564-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03563-0
Online ISBN: 978-3-642-03564-7
eBook Packages: Computer ScienceComputer Science (R0)