Star-complement-star on prefix-free languages
From MaRDI portal
Recommendations
Cites work
- Closures in formal languages and Kuratowski's theorem
- Cyclic shift on prefix-free languages
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Operational state complexity of prefix-free regular languages
- State complexity of k-union and k-intersection for prefix-free regular languages
- State complexity of combined operations
- The state complexities of some basic operations on regular languages
- The state complexity of star-complement-star
Cited in
(7)- The exact complexity of star-complement-star
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Kuratowski algebras generated by prefix-free languages
- The state complexity of star-complement-star
- PREFIX-FREE ŁUKASIEWICZ LANGUAGES
- Nondeterministic state complexity of star-free languages
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
This page was built for publication: Star-complement-star on prefix-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500696)