Pages that link to "Item:Q3533030"
From MaRDI portal
The following pages link to On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030):
Displayed 9 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- On the gap between separating words and separating their reversals (Q1698731) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- Complexity of bifix-free regular languages (Q5919577) (← links)
- Complexity of bifix-free regular languages (Q5920053) (← links)