Pages that link to "Item:Q2271463"
From MaRDI portal
The following pages link to Language operations with regular expressions of polynomial size (Q2271463):
Displayed 4 items.
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← 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)