### Abstract

We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximally parallel manner, then the class of context-sensitive languages is obtained.

Original language | English |
---|---|

Pages (from-to) | 109-126 |

Number of pages | 18 |

Journal | Natural Computing |

Volume | 5 |

Issue number | 2 |

DOIs | |

Publication status | Published - May 2006 |

### Fingerprint

### Keywords

- Accepting P systems
- Communicating P systems
- Context-sensitive languages
- P automata
- Sub-logarithmic space complexity

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Natural Computing*,

*5*(2), 109-126. https://doi.org/10.1007/s11047-005-4461-1

**On the computational complexity of P automata.** / Csuhaj-Varjú, E.; Ibarra, Oscar H.; Vaszil, György.

Research output: Contribution to journal › Article

*Natural Computing*, vol. 5, no. 2, pp. 109-126. https://doi.org/10.1007/s11047-005-4461-1

}

TY - JOUR

T1 - On the computational complexity of P automata

AU - Csuhaj-Varjú, E.

AU - Ibarra, Oscar H.

AU - Vaszil, György

PY - 2006/5

Y1 - 2006/5

N2 - We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximally parallel manner, then the class of context-sensitive languages is obtained.

AB - We characterize the classes of languages over finite alphabets which may be described by P automata, i.e., accepting P systems with communication rules only. Motivated by properties of natural computing systems, and the actual behavior of P automata, we study computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and relate these to the language classes described by P automata. We prove that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximally parallel manner, then the class of context-sensitive languages is obtained.

KW - Accepting P systems

KW - Communicating P systems

KW - Context-sensitive languages

KW - P automata

KW - Sub-logarithmic space complexity

UR - http://www.scopus.com/inward/record.url?scp=33745164941&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745164941&partnerID=8YFLogxK

U2 - 10.1007/s11047-005-4461-1

DO - 10.1007/s11047-005-4461-1

M3 - Article

AN - SCOPUS:33745164941

VL - 5

SP - 109

EP - 126

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 2

ER -