On the degree of scattered context-sensitivity

Authors:
Henning Fernau;Alexander 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:
Theoretical Computer Science
Year:
2003

Citing 3
Cited 7

Syntactic complexity of scattered context grammars

Acta Informatica
Generative power of three-dimensional scattered context grammars

Theoretical Computer Science
Introduction to Formal Language Theory

Introduction to Formal Language Theory

Descriptional complexity of scattered rewriting and multirewriting: an overview

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

Information Processing Letters
On the descriptional complexity of some rewriting mechanisms regulated by context conditions

Theoretical Computer Science - Descriptional complexity of formal systems
Canonical scattered context generators of sentences with their parses

Theoretical Computer Science
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	5.24

Visualization

Abstract

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with no more than two context-sensitive productions.