Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation-Reference-Cited by-同舟云学术

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation

Published:2019-09 Issue:06n07 Volume:30 Page:1091-1115
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Jirásek Jozef¹,Palmovský Matúš²,Šebej Juraj³

Affiliation:

1. Department of Computer Science, University of Saskatchewan, 110 Science Place, Saskatoon, SK S7N 5C9, Canada

2. Mathematical Institute, Slovak Academy of Sciences, Grešákova 6, 040 01 Košice, Slovakia

3. Institute of Computer Science, Faculty of Science, P. J. Šafárik University, Jesenná 5, 040 01 Košice, Slovakia

Abstract

We study Kuratowski algebras generated by prefix-, suffix-, factor-, and subword-free languages under the operations of star and complementation. We examine 12 possible algebras, and for each of them, we decide whether or not it can be generated by a prefix-, suffix-, factor-, or subword-free language. In each case when an algebra can be generated by such a language, we show that this language can 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.

Funder

Natural Sciences and Engineering Research Council of Canada Grant

VEGA

APVV

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054119400306

Reference22 articles.

1. CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM

2. On the State Complexity of the Shuffle of Regular Languages

3. Quotient Complexity of Closed Languages

4. Lecture Notes in Computer Science;Cmorik R.,2011