dP automata versus right-linear simple matrix grammars

Authors:
Gheorghe Păun;Mario J. Pérez-Jiménez
Affiliations:
Institute of Mathematics of the Romanian Academy, Bucureşti, Romania;Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Year:
2012

Citing 5
Cited 0

Communication complexity and parallel computing

Communication complexity and parallel computing
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P and dP automata: a survey

Rainbow of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.