Descriptional complexity of scattered rewriting and multirewriting: an overview

Authors:
Alexander Meduna
Affiliations:
Department of Information Systems, Brno University of Technology, Bozetechova 2, Brno 612 66, Czech Republic
Venue:
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Year:
2002

Citing 10
Cited 2

k-limited OL systems and languages

Journal of Information Processing and Cybernetics
On k-uniformly-limited TOL systems and languages

Journal of Information Processing and Cybernetics
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Descriptional complexity of multi-continuous grammars

Acta Cybernetica
Automata and languages: theory and applications

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

Theoretical Computer Science
Terminating left-hand sides of scattered context productions

Theoretical Computer Science
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On the degree of scattered context-sensitivity

Theoretical Computer Science

On Descriptional Complexity of Partially Parallel Grammars

Fundamenta Informaticae
On Descriptional Complexity of Partially Parallel Grammars

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

During a derivation step, partially parallel grammars rewrite some symbols of the sentential form while leaving the others unrewritten. The present paper discusses grammars that perform two types of this parallelism - scattered rewriting and multirewriting. It gives an overview of the main results concerning their descriptional complexity with respect to the number of nonterminals or productions. In the conclusion, some open problems are pointed out.