{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T06:51:05Z","timestamp":1674111065995},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,10]]},"abstract":"<jats:p> We introduce the notion of stateless multihead two-way (respectively, one-way) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems, namely, token systems and sequential tissue-like P systems. <\/jats:p>","DOI":"10.1142\/s0129054108006261","type":"journal-article","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T08:53:14Z","timestamp":1226307194000},"page":"1259-1276","source":"Crossref","is-referenced-by-count":10,"title":["ON STATELESS AUTOMATA AND P SYSTEMS"],"prefix":"10.1142","volume":"19","author":[{"given":"LINMIN","family":"YANG","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Washington State University, Pullman, Washington 99164, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZHE","family":"DANG","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Washington State University, Pullman, Washington 99164, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"OSCAR H.","family":"IBARRA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, California 93106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003340"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.285"},{"key":"rf3","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(74)90043-X"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.028"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00659-X"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1693"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108006261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:33:13Z","timestamp":1565137993000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108006261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":9,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,10]]}},"alternative-id":["10.1142\/S0129054108006261"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108006261","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}