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

DOI10.1142/S0129054119400306zbMath1427.68146OpenAlexW2973570009WikidataQ127226764 ScholiaQ127226764MaRDI QIDQ5205044

Juraj Šebej, Jozef jun. Jirásek, Matúš Palmovský

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119400306

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14--16, 2011. Revised selected papers
• State complexity of basic operations on suffix-free regular languages
• Quotient complexity of closed languages
• Kuratowski algebras generated by factor-, subword-, and suffix-free languages
• On the State Complexity of the Shuffle of Regular Languages
• Kuratowski Algebras Generated by Prefix-Free Languages
• Kleene closure and state complexity
• CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
• The State Complexity of Star-Complement-Star
• Kleene Closure on Regular and Prefix-Free Languages
• The Boundary of Prefix-Free Languages
• State Complexity of Boundary of Prefix-Free Regular Languages
• The Kuratowski Closure-Complement Problem
• Cyclic Shift on Prefix-Free Languages
• Star-Complement-Star on Prefix-Free Languages

This page was built for publication: Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation