Scattered context grammars
From MaRDI portal
Cites work
Cited in
(54)- On the descriptional complexity of scattered context grammars
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
- A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations
- Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- Context-free like restrictions on selective rewriting
- Degree-languages: A new concept of acceptance
- Control sets on context-free grammar forms
- An observation on scattered grammars
- Chart parsing of scattered context grammars
- On parsing coupled-context-free languages
- LR(k)-coupled-context-free grammars
- On the degree of scattered context-sensitivity.
- Terminating left-hand sides of scattered context productions M. Nivat
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Manipulating derivation forests by scheduling techniques
- Normal forms for context-sensitive grammars
- Theory of formal grammars
- Syntactic complexity of scattered context grammars
- Simple restriction in context-free rewriting
- Independent parallelism in finite copying parallel rewriting systems
- Canonical scattered context generators of sentences with their parses
- A hierarchy between context-free and context-sensitive languages
- A note on scattered context grammars
- Direction controlled programmed grammars
- Absolutely parallel grammars and two-way finite-state transducers
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- A note on leftmost restricted random context grammars
- Some concepts for languages more powerful than context-free
- Expressiveness and complexity of regular pure two-dimensional context-free languages
- One-sided random context grammars: a survey
- scientific article; zbMATH DE number 3817693 (Why is no real title available?)
- Scattered context grammars generate any recursively enumerable language with two nonterminals
- On the complexity of finite, pushdown, and stack automata
- On coupled languages and translations
- Size, index, and context-sensitivity of controlled partition grammars
- An algebraic technique for context-sensitive parsing
- Lexicalized non-local MCTAG with dominance links is NP-complete
- Fast uniform analysis of coupled-context-free languages
- Outils et résultats pour les transducteurs boustrophédons
- scientific article; zbMATH DE number 3797186 (Why is no real title available?)
- CD grammar systems with two propagating scattered context components characterize the family of context sensitive languages
- Scattered context grammars with one non-context-free production are computationally complete
- Quasi-realtime languages
- Multi-stack-counter languages
- Membership for growing context-sensitive grammars is polynomial
- CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
- On elimination of erasing rules from E0S grammars
- Priorities on context conditions in rewriting systems
- Rewriting systems with a clocking mechanism
- On regularity of context-free languages
- One-sided random context grammars
- Parsing and generation with static discontinuity grammars
This page was built for publication: Scattered context grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2532394)
