### Abstract

Acceptance and recognizability of finite strings by red–green Turing machines are defined via infinite runs on the input string and the way how to distinguish between red and green states. We extend the notion of red–green Turing machines to register machines with an input tape and then to several variants of P automata. In order to allow for correct simulations of infinite computations of register machines, the models of P automata have to avoid trapping leading to unwanted infinite computations. Therefore, besides the original model of P automata using antiport rules we here consider two models introduced just recently and also allowing for deterministic simulations of register machine instructions, i.e., we consider the models of P systems with anti-matter as well as catalytic P systems with toxic objects. For all these models of P automata we define their red–green variants and show that they can simulate red–green register machines and therefore red–green Turing machines.

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

Pages (from-to) | 139-157 |

Number of pages | 19 |

Journal | |

Volume | 8961 |

DOIs | |

Publication status | Published - 2014 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

**Red–Green P Automata.** / Aman, Bogdan; Csuhaj-Varjú, E.; Freund, Rudolf.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Red–Green P Automata

AU - Aman, Bogdan

AU - Csuhaj-Varjú, E.

AU - Freund, Rudolf

PY - 2014

Y1 - 2014

N2 - Acceptance and recognizability of finite strings by red–green Turing machines are defined via infinite runs on the input string and the way how to distinguish between red and green states. We extend the notion of red–green Turing machines to register machines with an input tape and then to several variants of P automata. In order to allow for correct simulations of infinite computations of register machines, the models of P automata have to avoid trapping leading to unwanted infinite computations. Therefore, besides the original model of P automata using antiport rules we here consider two models introduced just recently and also allowing for deterministic simulations of register machine instructions, i.e., we consider the models of P systems with anti-matter as well as catalytic P systems with toxic objects. For all these models of P automata we define their red–green variants and show that they can simulate red–green register machines and therefore red–green Turing machines.

AB - Acceptance and recognizability of finite strings by red–green Turing machines are defined via infinite runs on the input string and the way how to distinguish between red and green states. We extend the notion of red–green Turing machines to register machines with an input tape and then to several variants of P automata. In order to allow for correct simulations of infinite computations of register machines, the models of P automata have to avoid trapping leading to unwanted infinite computations. Therefore, besides the original model of P automata using antiport rules we here consider two models introduced just recently and also allowing for deterministic simulations of register machine instructions, i.e., we consider the models of P systems with anti-matter as well as catalytic P systems with toxic objects. For all these models of P automata we define their red–green variants and show that they can simulate red–green register machines and therefore red–green Turing machines.

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

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

U2 - 10.1007/978-3-319-14370-5_9

DO - 10.1007/978-3-319-14370-5_9

M3 - Article

VL - 8961

SP - 139

EP - 157

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -