Closures in Formal Languages and Kuratowski's Theorem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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. We show that there are precisely 9 such algebras in the case of positive closure, and 12 in the case of Kleene closure.
submitted to DLT 2009

Keywords

Computational Complexity, Formal Languages and Automata Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/226856

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.3761
 http://arxiv.org/abs/0901.3761

Collections

arXiv