Pages that link to "Item:Q579948"

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

Displaying 37 items.

• Lexicalized non-local MCTAG with dominance links is NP-complete (Q438591) (← links)
• On state-alternating context-free grammars (Q557822) (← links)
• A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
• The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
• Probabilistic length-reducing two-pushdown automata (Q841617) (← 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)
• Weighted restarting automata (Q1797778) (← links)
• Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
• On the expressive power of stateless ordered restart-delete automata (Q2230720) (← links)
• Regulated variants of limited context restarting automata (Q2358691) (← links)
• Lower bound technique for length-reducing automata (Q2381504) (← links)
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
• Hierarchies of weakly monotone restarting automata (Q3025320) (← links)
• Nondeterministic Ordered Restarting Automata (Q3177341) (← links)
• The complexity of membership for deterministic growing context-sensitive grammars^∗ (Q3210903) (← links)
• A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata (Q3297753) (← links)
• Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
• SHRINKING RESTARTING AUTOMATA (Q3434280) (← links)
• On Alternating Phrase-Structure Grammars (Q3540130) (← links)
• On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
• On weak growing context-sensitive grammars (Q5096331) (← links)
• Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
• Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)
• A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
• ON ALTERNATING PHRASE-STRUCTURE GRAMMARS (Q5187849) (← links)
• On Restarting Automata with Window Size One (Q5200077) (← links)
• On growing context-sensitive languages (Q5204308) (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
• On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness (Q5859630) (← links)
• On deterministic ordered restart-delete automata (Q5919676) (← links)