Pages that link to "Item:Q759489"
From MaRDI portal
The following pages link to On regularity of context-free languages (Q759489):
Displaying 21 items.
- Two complexity measures for context-free languages (Q3821606) (← links)
- (Q4298445) (← links)
- (Q4436372) (← links)
- On Basic Properties of Jumping Finite Automata (Q4639928) (← links)
- Unavoidable Set: Extension and Reduction (Q4718891) (← links)
- (Q4780107) (← links)
- (Q4818834) (← links)
- Unavoidable languages, cuts and innocent sets of words (Q4858836) (← links)
- Embedding with patterns and associated recursive path ordering (Q5055733) (← links)
- (Q5061518) (← links)
- (Q5092424) (← links)
- (Q5422558) (← links)
- (Q5450110) (← links)
- Regular Realizability Problems and Context-Free Languages (Q5500698) (← links)
- (Q5696194) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- Language inclusion algorithms as complete abstract interpretations (Q6536285) (← links)
- Characterization of ordered semigroups generating well quasi-orders of words (Q6580076) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)