Pages that link to "Item:Q3637232"
From MaRDI portal
The following pages link to Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232):
Displayed 9 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)