Pages that link to "Item:Q3520302"
From MaRDI portal
The following pages link to Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302):
Displayed 21 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- Automata for regular expressions with shuffle (Q1706150) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- The chop of languages (Q2358686) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- Chrobak Normal Form Revisited, with Applications (Q5200060) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)