Pages that link to "Item:Q2549240"
From MaRDI portal
The following pages link to A characterization of context-free languages (Q2549240):
Displaying 18 items.
- Insertion languages (Q796994) (← links)
- Kleene modules and linear languages (Q817584) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- Extended regular expressions of arbitrary star degrees (Q1193870) (← links)
- Über eine explizite Darstellung von Listenstrukturen (Q1219680) (← links)
- Iterating iterated substitution (Q1241066) (← links)
- A simplified proof of Parikh's theorem (Q1241068) (← links)
- Classes of formal grammars (Q1248342) (← links)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- On a generalization of regular expressions (Q1592084) (← links)
- Extending regular expressions with homomorphic replacement (Q3566350) (← links)
- Inductive inference of context-free languages based on context-free expressions (Q3806846) (← links)
- Abstract families of context-free grammars (Q3902532) (← links)
- Characterizations of regular and context-free matrices (Q4057628) (← links)
- Recursive generation of local adjunct languages (Q4086727) (← links)
- (Q5180870) (← links)
- ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS (Q5495418) (← links)
- Balanced-by-Construction Regular and ω-Regular Languages (Q6169961) (← links)