Skip to Main content Skip to Navigation
Conference papers

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages

Abstract : We study Kuratowski algebras generated by suffix-, factor-, and subword-free languages under the operations of star and complementation. We examine 12 possible algebras, and for each of them, we provide an answer to the question whether or not it can be generated by a suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language may be taken to be regular, and we compute upper bounds on the state complexities of all the generated languages. Finally, we find generators that maximize these complexities.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, December 6, 2017 - 11:44:33 AM
Last modification on : Wednesday, December 6, 2017 - 1:46:16 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Jozef Jirásek Jr., Matúš Palmovský, Juraj Šebej. Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.189-201, ⟨10.1007/978-3-319-60252-3_15⟩. ⟨hal-01657013⟩



Record views


Files downloads