Formal languages
Scattered versus context-sensitive rewriting
Acta Informatica
Introduction to formal languages
Introduction to formal languages
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Automata and languages: theory and applications
Automata and languages: theory and applications
Generative power of three-dimensional scattered context grammars
Theoretical Computer Science
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
On the degree of scattered context-sensitivity
Theoretical Computer Science
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Journal of Computer and System Sciences
On the generation of sentences with their parses by propagating regular-controlled grammars
Theoretical Computer Science
| Hi-index | 5.23 |
Scattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L's sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals.