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

DOI10.1142/S0129054119400306MaRDI QIDQ5205044zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• Kuratowski algebras generated by factor-, subword-, and suffix-free languages
• Kuratowski algebras generated by prefix-free languages
• Star-complement-star on prefix-free languages
• A note on the commutative closure of star-free languages
• The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words
• Square, power, positive closure, and complementation on star-free languages
• On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
• Star-free languages and local divisors
• Prefix-free subsets of regular languages and descriptional complexity
• scientific article; zbMATH DE number 871238

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Closures in formal languages and Kuratowski's theorem
• Cyclic shift on prefix-free languages
• Kleene Closure on Regular and Prefix-Free Languages
• Kleene closure and state complexity
• Kuratowski algebras generated by factor-, subword-, and suffix-free languages
• Kuratowski algebras generated by prefix-free languages
• Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14--16, 2011. Revised selected papers
• On the State Complexity of the Shuffle of Regular Languages
• Operational state complexity of prefix-free regular languages
• Star-complement-star on prefix-free languages
• State complexity of basic operations on suffix-free regular languages
• State complexity of boundary of prefix-free regular languages
• The Kuratowski Closure-Complement Problem
• The boundary of prefix-free languages
• The state complexity of star-complement-star

Cited in

(5)

• Kuratowski algebras generated by factor-, subword-, and suffix-free languages
• Closures in Formal Languages and Kuratowski’s Theorem
• Closures in formal languages and Kuratowski's theorem
• Kuratowski algebras generated by prefix-free languages
• Classes of languages generated by the Kleene star of a word

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205044)