{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:02:23Z","timestamp":1649070143426},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","funder":[{"name":"National Research, Development and Innovation Fund of Hungary","award":["K 120558","K_16"],"award-info":[{"award-number":["K 120558","K_16"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p> M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Some questions that have been left open in the forerunner papers are examined, and the computational power of deterministic M-rate 0L systems is investigated, where also tabled and extended variants are taken into consideration. <\/jats:p>","DOI":"10.1142\/s0129054120400031","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T06:55:02Z","timestamp":1580453702000},"page":"37-51","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Lindenmayer Systems with Dynamic Control of Parallelism"],"prefix":"10.1142","volume":"31","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Potsdam, August-Bebel-Stra\u00dfe 89, 14482 Potsdam, Germany"}]},{"given":"Gy\u00f6rgy","family":"Vaszil","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Informatics, University of Debrecen, Kassai \u00fat 26, 4028 Debrecen, Hungary"}]}],"member":"219","published-online":{"date-parts":[[2020,1,29]]},"reference":[{"key":"S0129054120400031BIB001","first-page":"27","volume":"21","author":"Bordihn H.","year":"2016","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"S0129054120400031BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/11963516_21"},{"key":"S0129054120400031BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2"},{"key":"S0129054120400031BIB004","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1991250504731"},{"key":"S0129054120400031BIB005","volume-title":"Developmental Systems and Languages","author":"Herman G. T.","year":"1975"},{"key":"S0129054120400031BIB006","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"S0129054120400031BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_5"},{"key":"S0129054120400031BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(68)90079-9"},{"key":"S0129054120400031BIB009","volume-title":"The Mathematical Theory of L Systems","author":"Rozenberg G.","year":"1980"},{"key":"S0129054120400031BIB010","volume-title":"Theory of Computation","author":"Wood D.","year":"1987"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120400031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T06:55:22Z","timestamp":1580453722000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120400031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":10,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1142\/S0129054120400031"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120400031","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}