Pages that link to "Item:Q2909093"
From MaRDI portal
The following pages link to The complexity of regular(-like) expressions (Q2909093):
Displaying 12 items.
- Implication of regular expressions (Q452941) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Concatenation-free languages (Q2357107) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← links)
- Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet (Q3970885) (← links)
- Expressive capacity of subregular expressions (Q5223616) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)