The following pages link to Alexander Meduna (Q385969):
Displaying 50 items.
- One-sided random context grammars with a limited number of right random context rules (Q385971) (← links)
- Controlled finite automata (Q404012) (← links)
- Workspace theorems for regular-controlled grammars (Q638524) (← links)
- Left-forbidding cooperating distributed grammar systems (Q708220) (← links)
- One-sided random context grammars (Q766166) (← links)
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way (Q1006344) (← links)
- A simultaneous reduction of several measures of descriptional complexity in scattered context grammars (Q1007611) (← links)
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations (Q1019169) (← links)
- Context free derivations on word monoids (Q1263994) (← links)
- On the degree of scattered context-sensitivity. (Q1401221) (← links)
- Coincidental extension of scattered context languages (Q1424350) (← links)
- Forbidding ET0L grammars. (Q1426468) (← links)
- (Q1566739) (redirect page) (← links)
- Terminating left-hand sides of scattered context productions M. Nivat (Q1566740) (← links)
- Generative power of three-nonterminal scattered context grammars (Q1583096) (← links)
- Syntactic complexity of context-free grammars over word monoids (Q1816000) (← links)
- Homogeneous grammars with a reduced number of non-context-free products (Q1847383) (← links)
- Syntactic complexity of scattered context grammars (Q1892719) (← links)
- On the generation of sentences with their parses by propagating regular-controlled grammars (Q1945943) (← links)
- On operations over language families (Q2209512) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Canonical scattered context generators of sentences with their parses (Q2465627) (← links)
- Deep pushdown automata (Q2491213) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
- (Q2711327) (← links)
- (Q2714410) (← links)
- (Q2816364) (← links)
- Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]" (Q2833548) (← links)
- Generalized one-sided forbidding grammars (Q2868164) (← links)
- (Q2893941) (← links)
- Solutions to four open problems concerning controlled pure grammar systems (Q2921920) (← links)
- One-Sided Random Context Grammars: A Survey (Q2944900) (← links)
- Some Power-Decreasing Derivation Restrictions in Grammar Systems (Q3113295) (← links)
- (Q3113303) (← links)
- (Q3113305) (← links)
- Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages (Q3123354) (← links)
- One-Sided Random Context Grammars with Leftmost Derivations (Q3166950) (← links)
- An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets (Q3167585) (← links)
- (Q3357553) (← links)
- Jumping Grammars (Q3455751) (← links)
- Generalized forbidding grammars (Q3479537) (← links)
- (Q3562979) (← links)
- (Q3601874) (← links)
- (Q3615307) (← links)
- On context-free rewriting with a simple restriction and its computational completeness (Q3625698) (← links)
- (Q3779762) (← links)
- (Q3782814) (← links)
- (Q3801102) (← links)
- (Q4036176) (← links)
