Pages that link to "Item:Q4923279"
From MaRDI portal
The following pages link to QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279):
Displaying 8 items.
- Descriptional complexity of regular languages (Q2074214) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- Large Aperiodic Semigroups (Q5744128) (← links)
