Sublinear-Space p systems with active membranes

Authors:
Antonio E. Porreca;Alberto Leporati;Giancarlo Mauri;Claudio Zandron
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy
Venue:
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Year:
2012

Citing 4
Cited 1

On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
The computational power of membrane systems under tight uniformity conditions

Natural Computing: an international journal

Space complexity equivalence of P systems with active membranes and Turing machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a weak uniformity condition for families of P systems, DLOGTIME uniformity, inspired by Boolean circuit complexity. We then prove that DLOGTIME-uniform families of P systems with active membranes working in logarithmic space (not counting their input) can simulate logarithmic-space deterministic Turing machines.