Variants of distributed p automata and the efficient parallelizability of languages

Authors:
György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 5
Cited 0

P Automata or Purely Communicating Accepting P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the parallelizability of languages accepted by P automata

Computation, cooperation, and life
P finite automata and regular languages over countably infinite alphabets

WMC'06 Proceedings of the 7th international conference on Membrane Computing
On the computational complexity of P automata

DNA'04 Proceedings of the 10th international conference on DNA computing
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an overview of P automata and distributed P automata and the parallelizability of their accepted languages by focusing on those features of these systems which influence the efficiency of the parallelization.