Kántor, Kristóf and Vaszil, György (2018) Generalized P Colony Automata and Their Relation to P Automata. In: 18th International Conference on Membrane Computing, July 25-28, 2018, Bradford, UK.
![[img]](http://real.mtak.hu/style/images/fileicons/text.png) |
Text
KantorVaszil-CMC18-LNCS-revised.pdf Restricted to Registered users only Download (283kB) |
Abstract
We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | György Vaszil |
| Date Deposited: | 26 Sep 2018 01:52 |
| Last Modified: | 26 Sep 2018 01:52 |
| URI: | http://real.mtak.hu/id/eprint/85365 |
Actions (login required)
 |
Edit Item |
