Pages that link to "Item:Q2829972"
From MaRDI portal
The following pages link to On the State Complexity of the Shuffle of Regular Languages (Q2829972):
Displaying 13 items.
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- (Q5003075) (← links)
- (Q5020533) (← links)
- A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation (Q5205044) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)
