Maximal and minimal scattered context rewriting

Authors:
Alexander Meduna;Jiří Techet
Affiliations:
Department of Information Systems, Brno University of Technology, Brno, Czech Republic;Department of Information Systems, Brno University of Technology, Brno, Czech Republic
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 9
Cited 1

Formal languages

Formal languages
Scattered versus context-sensitive rewriting

Acta Informatica
Automata and languages: theory and applications

Automata and languages: theory and applications
Generative power of three-dimensional scattered context grammars

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
On the descriptional complexity of some rewriting mechanisms regulated by context conditions

Theoretical Computer Science - Descriptional complexity of formal systems
Generation of sentences with their parses: the case of propagating scattered context grammars

Acta Cybernetica
Scattered context grammars

Journal of Computer and System Sciences
An hierarchy between context-free and context-sensitive languages

Journal of Computer and System Sciences

An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

As their name suggest, during a maximal derivation step, a scattered context grammar G rewrites the maximal number of nonterminals while during a minimal derivation step, G rewrites the minimal number of nonterminals. This paper demonstrates that if the propagating scattered context grammars derive their sentences by making either of these two derivation steps, then they characterize the family of context sensitive languages.