The following pages link to (Q4051631):
Displaying 14 items.
- The generative power of delegation networks (Q897662) (← links)
- Hierarchies of hyper-AFLs (Q1058860) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- A decomposition theorem for hyper-algebraic extensions of language families (Q1225945) (← links)
- A strong pumping lemma for context-free languages (Q1238637) (← links)
- Iterating iterated substitution (Q1241066) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- Effective constructions in well-partially-ordered free monoids (Q1249047) (← links)
- Counting productions in context-free derivations (Q1249944) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Fuzzy context-free languages. I: Generalized fuzzy context-free grammars (Q2576872) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Fuzzy pushdown automata (Q5919885) (← links)
