Pages that link to "Item:Q5401550"
From MaRDI portal
The following pages link to IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES (Q5401550):
Displayed 25 items.
- Syntactic complexity of regular ideals (Q722210) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures (Q2333820) (← links)
- Syntactic complexity of bifix-free languages (Q2399256) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- Unrestricted State Complexity of Binary Operations on Regular Languages (Q2829970) (← links)
- Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
- Kleene closure and state complexity (Q2956884) (← links)
- (Q5020533) (← links)
- (Q5130744) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach (Q5298308) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
- Large Aperiodic Semigroups (Q5744128) (← links)
- State Complexity of Overlap Assembly (Q5859665) (← links)
- Complexity of proper prefix-convex regular languages (Q5919576) (← links)
- Complexity of bifix-free regular languages (Q5919577) (← links)
- Complexity of proper prefix-convex regular languages (Q5920052) (← links)
- Complexity of bifix-free regular languages (Q5920053) (← links)
- Operational state complexity revisited: the contribution of monsters and modifiers (Q6175083) (← links)