Pages that link to "Item:Q579948"

The following pages link to Membership for growing context-sensitive grammars is polynomial (Q579948):

Displayed 15 items.

• On state-alternating context-free grammars (Q557822) ‎ (← links)
• Restarting automata with restricted utilization of auxiliary symbols (Q860860) ‎ (← links)
• On the complexity of 2-monotone restarting automata (Q927391) ‎ (← links)
• Properties that characterize LOGCFL (Q1176109) ‎ (← links)
• Growing context-sensitive languages and Church-Rosser languages (Q1383712) ‎ (← links)
• McNaughton families of languages. (Q1401181) ‎ (← links)
• The context-splittable normal form for Church-Rosser language systems. (Q1401938) ‎ (← links)
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) ‎ (← links)
• Independent parallelism in finite copying parallel rewriting systems (Q1960409) ‎ (← links)
• Lower bound technique for length-reducing automata (Q2381504) ‎ (← links)
• Hierarchies of weakly monotone restarting automata (Q3025320) ‎ (← links)
• The complexity of membership for deterministic growing context-sensitive grammars^∗ (Q3210903) ‎ (← links)
• SHRINKING RESTARTING AUTOMATA (Q3434280) ‎ (← links)
• On Alternating Phrase-Structure Grammars (Q3540130) ‎ (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) ‎ (← links)