Quotient complexity of regular languages
From MaRDI portal
Cited in
(30)- Primitivity, uniform minimality, and state complexity of Boolean operations
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Complexity of proper prefix-convex regular languages
- Maximal state complexity and generalized de Bruijn words
- State complexity of GF(2)-operations on unary languages
- Operational complexity and right linear grammars
- State complexity of permutation on finite languages over a binary alphabet
- Language quotients revisited
- Operational accepting state complexity: the unary and finite case
- Syntactic complexity of regular ideals
- Nondeterministic state complexity of star-free languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Nondeterministic state complexity of star-free languages
- Operational complexity: NFA-to-DFA trade-off
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
- Self-verifying finite automata and descriptional complexity
- Upper bound on syntactic complexity of suffix-free languages
- Manipulation of regular expressions using derivatives: an overview
- Left quotients of deterministic context-free languages
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
- Syntactic complexity of suffix-free languages
- Complexity of proper prefix-convex regular languages
- Descriptional complexity of regular languages
- Syntactic complexity of bifix-free regular languages
- Syntactic complexity of bifix-free languages
- Complexity of suffix-free regular languages
- Complexity of suffix-free regular languages
- Formal languages over GF(2)
- Unrestricted state complexity of binary operations on regular languages
This page was built for publication: Quotient complexity of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819381)
