Formal languages
Scattered versus context-sensitive rewriting
Acta Informatica
Introduction to formal languages
Introduction to formal languages
Linear Models for Keystream Generators
IEEE Transactions on Computers
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
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
Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Canonical scattered context generators of sentences with their parses
Theoretical Computer Science
Maximal and minimal scattered context rewriting
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
Propagating scattered context grammars are used to generate their sentences together with their parses--that is, the sequences of labels denoting productions whose use lead to the generation of the corresponding sentences. It is proved that for every recursively enumerable language L, there exists a propagating scattered context grammar whose language consists of L's sentences followed by their parses.