Quotient complexity of bifix-, factor-, and subword-free regular languages
From MaRDI portal
Publication:5250874
Recommendations
Cited in
(23)- The cut operation in subclasses of convex languages
- Nondeterministic complexity in subclasses of convex languages
- Prefix-free subsets of regular languages and descriptional complexity
- Power, positive closure, and quotients on convex languages
- Complexity of suffix-free regular languages
- Complexity of suffix-free regular languages
- Closure properties of subregular languages under operations
- On the computation of quotients and factors of regular languages
- Generalizations of Code Languages with Marginal Errors
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Nondeterministic state complexity of star-free languages
- Prefix-free languages: left and right quotient and reversal
- Prefix-free languages: right quotient and reversal
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
- Nondeterministic complexity of operations on free and convex languages
- Syntactic complexity of bifix-free regular languages
- Operational complexity in subregular classes
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
- Quotient complexity of regular languages
- Quotient complexity of star-free languages
- The cut operation in subclasses of convex languages (extended abstract)
This page was built for publication: Quotient complexity of bifix-, factor-, and subword-free regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250874)
