The following pages link to Scattered context grammars (Q2532394):
Displaying 50 items.
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- Lexicalized non-local MCTAG with dominance links is NP-complete (Q438591) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Priorities on context conditions in rewriting systems (Q754654) (← links)
- Rewriting systems with a clocking mechanism (Q754655) (← links)
- On regularity of context-free languages (Q759489) (← links)
- One-sided random context grammars (Q766166) (← links)
- Parsing and generation with static discontinuity grammars (Q922717) (← links)
- On the descriptional complexity of scattered context grammars (Q1001907) (← 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)
- Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 (Q1054158) (← links)
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index (Q1099632) (← links)
- Context-free like restrictions on selective rewriting (Q1157178) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- An observation on scattered grammars (Q1259906) (← links)
- Chart parsing of scattered context grammars (Q1324440) (← links)
- On parsing coupled-context-free languages (Q1351955) (← links)
- LR(k)-coupled-context-free grammars (Q1352135) (← links)
- On the degree of scattered context-sensitivity. (Q1401221) (← links)
- Terminating left-hand sides of scattered context productions M. Nivat (Q1566740) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- Manipulating derivation forests by scheduling techniques (Q1820586) (← links)
- Normal forms for context-sensitive grammars (Q1845477) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Syntactic complexity of scattered context grammars (Q1892719) (← links)
- Simple restriction in context-free rewriting (Q1959430) (← links)
- Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
- Canonical scattered context generators of sentences with their parses (Q2465627) (← links)
- A hierarchy between context-free and context-sensitive languages (Q2544411) (← links)
- A note on scattered context grammars (Q2549582) (← links)
- Direction controlled programmed grammars (Q2554956) (← links)
- Absolutely parallel grammars and two-way finite-state transducers (Q2555753) (← links)
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology (Q2557562) (← links)
- A note on leftmost restricted random context grammars (Q2560719) (← links)
- Some concepts for languages more powerful than context-free (Q2560720) (← links)
- Expressiveness and complexity of regular pure two-dimensional context-free languages (Q2855787) (← links)
- One-Sided Random Context Grammars: A Survey (Q2944900) (← links)
- (Q3665095) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- On coupled languages and translations (Q4131693) (← links)
- Size, index, and context-sensitivity of controlled partition grammars (Q4139706) (← links)
- An algebraic technique for context-sensitive parsing (Q4185837) (← links)
- Fast uniform analysis of Coupled-Context-Free languages (Q4632444) (← links)
- Outils et résultats pour les transducteurs boustrophédons (Q4728282) (← links)
- (Q4742319) (← links)
- (Q5016368) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
