Pages that link to "Item:Q2271463"
From MaRDI portal
The following pages link to Language operations with regular expressions of polynomial size (Q2271463):
Displayed 11 items.
- 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)
- Operational complexity and right linear grammars (Q2041682) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- A logic for document spanners (Q2322723) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)