Pages that link to "Item:Q1227704"
From MaRDI portal
The following pages link to Complexity measures for regular expressions (Q1227704):
Displayed 36 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
- Some complexity results for polynomial rational expressions. (Q1874419) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- Commutative images of rational languages and the Abelian kernel of a monoid (Q3149083) (← links)
- Conversion of regular expressions into realtime automata (Q3423141) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← 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)
- Asymptotical behaviour of some non-uniform measures (Q3833644) (← links)
- Complexity results for multi-pebble automata and their logics (Q4632417) (← links)
- Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
- (Q5092323) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)