Pages that link to "Item:Q1120293"
From MaRDI portal
The following pages link to A pumping lemma for deterministic context-free languages (Q1120293):
Displaying 12 items.
- Measures of nondeterminism for pushdown automata (Q1337469) (← links)
- A pumping lemma for regular closure of prefix-free languages (Q2105458) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES (Q3401478) (← links)
- (Q5016371) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q5096344) (← links)
- The computational power of parsing expression grammars (Q5915559) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
- Freezing 1-Tag Systems with States (Q6204127) (← links)
