A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

Authors:
H. Fernau;A. Meduna
Affiliations:
University of Newcastle, School of Electrical Engineering and Computer Science, University Drive, NSW 2308 Callaghan, Australia;Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bozetechova 2, Brno 612 66, Czech Republic
Venue:
Information Processing Letters
Year:
2003

Citing 3
Cited 5

Generative power of three-dimensional scattered context grammars

Theoretical Computer Science
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
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach

Information and Computation
Nonterminal complexity of tree controlled grammars

Theoretical Computer Science
Language classes generated by tree controlled grammars with bounded nonterminal complexity

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Language classes generated by tree controlled grammars with bounded nonterminal complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with a reduced number of both nonterminals and context-sensing productions.