Pages that link to "Item:Q2074214"
From MaRDI portal
The following pages link to Descriptional complexity of regular languages (Q2074214):
Displaying 13 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- In Search of Most Complex Regular Languages (Q2914690) (← links)
- A Logical Descriptor for Regular Languages via Stone Duality (Q2938148) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- Simple regular expressions and languages (Q3517103) (← links)
- (Q3785993) (← links)
- Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet (Q3970885) (← links)
- (Q4790394) (← links)
- (Q4905126) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)