Pages that link to "Item:Q5458365"
From MaRDI portal
The following pages link to Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365):
Displaying 14 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- Communication and Streaming Complexity of Approximate Pattern Matching (Q5110877) (← links)
- Implementation and Application of Automata (Q5463995) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)