On three variants of rewriting P systems

Authors:
Claudio Ferretti;Giancarlo Mauri;Gheorghe Paun;Claudio Zandron
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Universitá di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Universitá di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy;Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700 Bucuresti, Romania;Dipartimento di Informatica, Sistemistica e Comunicazione, Universitá di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 4

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Context-Free-Like Forms for the Phrase-Structure Grammars

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Rewriting P systems with conditional communication

Formal and natural computing
Computing with Membranes: P Systems with Worm-Objects

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)

Parallel Rewriting P Systems without Target Conflicts

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Parallel Rewriting P Systems with Deadlock

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Rewriting P systems: improved hierarchies

Theoretical Computer Science
Descriptional complexity of rewriting P systems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky and Lindenmayer hierarchies.