Quotient complexity of bifix-, factor-, and subword-free regular languages
From MaRDI portal
Publication:5740416
Recommendations
Cited in
(13)- 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
- On the computation of quotients and factors of regular languages
- Nondeterministic state complexity of star-free languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Prefix-free languages: right quotient and reversal
- Square on ideal, closed and free languages
- Quotient complexity of star-free languages
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
- Prefix-free languages: left and right quotient and reversal
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 Q5740416)
