Abstract
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a given set. We re-examine this theorem in the setting of formal languages, where closure is either Kleene closure or positive closure. We classify languages according to the structure of the algebra they generate under iterations of complement and closure. There are precisely 9 such algebras in the case of positive closure, and 12 in the case of Kleene closure. We study how the properties of being open and closed are preserved under concatenation. We investigate analogues, in formal languages, of the separation axioms in topological spaces; one of our main results is that there is a clopen partition separating two words if and only if the words do not commute. We can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.
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
Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski’s theorem (preprint) (January 2009), http://arxiv.org/abs/0901.3761
Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages: concatenation, separation, and algorithms (January 2009), http://arxiv.org/abs/0901.3763
Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra, 2nd edn., http://www.math.uwaterloo.ca/snburris/htdocs/ualg.html
Chagrov, A.V.: Kuratowski numbers. In: Application of Functional Analysis in Approximation Theory, Kalinin. Gos. Univ., Kalinin, pp. 186–190 (1982) (in Russian)
Ellul, K., Krawetz, B., Shallit, J., Wang, M.-w.: Regular expressions: new results and open problems. J. Autom. Lang. Combin. 10, 407–437 (2005)
Fife, J.H.: The Kuratowski closure-complement problem. Math. Mag. 64, 180–182 (1991)
Gardner, B.J., Jackson, M.: The Kuratowski closure-complement theorem. New Zealand J. Math. (to appear); Preprint available at http://www.latrobe.edu.au/mathstats/department/algebra-research-group/Papers/GJ_Kuratowski.pdf
Graham, R.L., Knuth, D.E., Motzkin, T.S.: Complements and transitive closures. Discrete Math. 2, 17–29 (1972)
Hammer, P.C.: Kuratowski’s closure theorem. Nieuw Archief v. Wiskunde 7, 74–80 (1960)
Kuratowski, C.: Sur l’opération \(\overline{A}\) de l’analysis situs. Fund. Math. 3, 182–199 (1922)
Lyndon, R.C., Schützenberger, M.P.: The equation aM = bN cP in a free group. Michigan Math. J. 9, 289–298 (1962)
Peleg, D.: A generalized closure and complement phenomenon. Discrete Math. 50, 285–293 (1984)
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
Brzozowski, J., Grant, E., Shallit, J. (2009). Closures in Formal Languages and Kuratowski’s Theorem. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)