{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:22:48Z","timestamp":1777105368353,"version":"3.51.4"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p> P automata are variants of symport\/antiport membrane systems which describe string languages by applying a mapping to the sequence of multisets entering the system during computations. In this paper, we study their computational power in the case when the input mapping associates each input multiset with the set of strings consisting of all permutations of its elements. We show that P automata of this type are strictly less powerful than so-called restricted logarithmic space Turing machines, and we also exhibit a strict infinite hierarchy within the accepted language class based on the number of membranes present in the system. <\/jats:p>","DOI":"10.1142\/s0129054114400024","type":"journal-article","created":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T04:18:49Z","timestamp":1407471529000},"page":"391-408","source":"Crossref","is-referenced-by-count":3,"title":["P AUTOMATA WITH RESTRICTED POWER"],"prefix":"10.1142","volume":"25","author":[{"given":"ERZS\u00c9BET","family":"CSUHAJ-VARJ\u00da","sequence":"first","affiliation":[{"name":"Department of Algorithms and their Applications, Faculty of Informatics, E\u00f6tv\u00f6s Lor\u00e1nd University, P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1\/c, 1117 Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GY\u00d6RGY","family":"VASZIL","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Informatics, University of Debrecen, P. O. Box 12, 4010 Debrecen, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/11493785_7"},{"key":"p_3","first-page":"219","author":"Csuhaj-Varj\u00fa E.","year":"2003","journal-title":"Berlin"},{"key":"p_4","first-page":"231","volume":"78","author":"Freund R.","year":"2002","journal-title":"Bulletin of the EATCS"},{"key":"p_5","first-page":"5","volume":"63","author":"Freund R.","year":"2009","journal-title":"Mathematics-Informatics Series"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.007"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2010.2.2478"},{"key":"p_11","first-page":"125","author":"M.","year":"2010","journal-title":"Berlin Heidelberg"},{"key":"p_13","first-page":"170","year":"2011","journal-title":"Berlin Heidelberg"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114400024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:48:29Z","timestamp":1565189309000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114400024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,8,7]]},"published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1142\/S0129054114400024"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114400024","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}