Prefix-free subsets of regular languages and descriptional complexity
From MaRDI portal
Recommendations
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- scientific article; zbMATH DE number 7315105
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
Cites work
- 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 1418342 (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
- Prefix-free languages: right quotient and reversal
- State complexity of k-union and k-intersection for prefix-free regular languages
Cited in
(9)- About prefix sets of words
- On the height of towers of subsequences and prefixes
- Prefix-free regular languages and pattern matching
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Kleene Closure on Regular and Prefix-Free Languages
- scientific article; zbMATH DE number 1744267 (Why is no real title available?)
- scientific article; zbMATH DE number 7315105 (Why is no real title available?)
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation
- Theoretical Aspects of Computing – ICTAC 2005
This page was built for publication: Prefix-free subsets of regular languages and descriptional complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500687)
