A general framework for regulated rewriting based on the applicability of rules

Authors:
Rudolf Freund;Marian Kogler;Marion Oswald
Affiliations:
Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Vienna, Austria and Institute of Computer Science, Martin Luther University Halle-Wittenberg, Halle, Germany;Faculty of Informatics, Vienna University of Technology, Vienna, Austria and Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
Computation, cooperation, and life
Year:
2011

Citing 13
Cited 1

Control mechanisms on #-context-free array grammars

Mathematical aspects of natural and formal languages
Array Grammars, Patterns and Recognizers

Array Grammars, Patterns and Recognizers
Handbook of Formal Languages

Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computation: finite and infinite machines

Computation: finite and infinite machines
Multiset random context grammars, checkers, and transducers

Theoretical Computer Science
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing

Asynchronous and maximally parallel deterministic controlled non-cooperative p systems characterize NFIN and coNFIN

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a general model for various mechanisms of regulated rewriting based on the applicability of rules, especially we consider graph-controlled, programmed, matrix, random context, and ordered grammars as well as some basic variants of grammar systems. Most of the general relations between graph-controlled grammars, matrix grammars, random-context grammars, and ordered grammars established in this paper are independent from the objects and the kind of rules and only based on the notion of applicability of rules within the different regulating mechanisms and their specific structure in allowing sequences of rules to be applied. For example, graph-controlled grammars are always at least as powerful as programmed and matrix grammars. For the simulation of random context and ordered grammars by matrix and graph-controlled grammars, some specific requirements have to be fulfilled by the types of rules.