Pages that link to "Item:Q794441"

The following pages link to On the generative power of regular pattern grammars (Q794441):

Displaying 21 items.

• Regular and context-free pattern languages over small alphabets (Q391783) (← links)
• Applications of scheduling theory to formal language theory (Q1082085) (← links)
• A pumping result for 2-context-free languages (Q1114418) (← links)
• Table systems with unconditional transfer (Q1165020) (← links)
• Generative power of three-nonterminal scattered context grammars (Q1583096) (← links)
• Regular patterns, regular languages and context-free languages (Q1675877) (← links)
• Manipulating derivation forests by scheduling techniques (Q1820586) (← links)
• Syntactic complexity of scattered context grammars (Q1892719) (← links)
• Canonical scattered context generators of sentences with their parses (Q2465627) (← links)
• Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages (Q3123354) (← links)
• A combinatorial property of EOL languages (Q3711771) (← links)
• Hierarchy of k-context-free languages part 1 (Q3826119) (← links)
• Hierarchy of<i>k</i>-context-free languages (Q3826120) (← links)
• Prefix pushdown automata and their simplification (Q4254588) (← links)
• Middle quotients of linear languages (Q4254654) (← links)
• Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages (Q4375397) (← links)
• Simultaneously One-Turn Two-Pushdown Automata (Q4464412) (← links)
• One-sided forbidding grammars and selective substitution grammars (Q4903559) (← links)
• Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
• (Q5389836) (← links)
• (Q5446606) (← links)