The following pages link to Petr Zemek (Q385970):
Displayed 17 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)
- One-sided random context grammars (Q766166) (← links)
- On the generation of sentences with their parses by propagating regular-controlled grammars (Q1945943) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- (Q2816364) (← links)
- Generalized one-sided forbidding grammars (Q2868164) (← links)
- Solutions to four open problems concerning controlled pure grammar systems (Q2921920) (← links)
- One-Sided Random Context Grammars: A Survey (Q2944900) (← 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)
- One-sided forbidding grammars and selective substitution grammars (Q4903559) (← links)
- JUMPING FINITE AUTOMATA (Q4923298) (← links)
- Left Random Context ET0L Grammars (Q5300616) (← links)
- Regulated Grammars and Automata (Q5406167) (← links)
- (Q5740430) (← links)