{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T00:35:38Z","timestamp":1775349338232,"version":"3.50.1"},"reference-count":21,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100009232","name":"Debreceni Egyetem","doi-asserted-by":"publisher","award":["DETKA"],"award-info":[{"award-number":["DETKA"]}],"id":[{"id":"10.13039\/501100009232","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:p> We investigate the power of CD grammar systems using different types of leftmost derivations for all standard cooperation strategies including the so-called full-competence mode of derivation. It is proved that, for some types of leftmost restrictions and cooperation strategies, CD grammar systems generate the same language classes as in the unrestricted, \u201cnon-leftmost\u201d case, but the generative power is also increased or decreased in several cases. Thereby, some new relations to well-known Chomsky and Lindenmayer classes are presented. <\/jats:p>","DOI":"10.1142\/s0129054125430038","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T09:37:07Z","timestamp":1742290627000},"page":"247-267","source":"Crossref","is-referenced-by-count":1,"title":["Leftmost Derivations in CD Grammar Systems"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1317-2939","authenticated-orcid":false,"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Potsdam, An der Bahn 2, 14467 Potsdam, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1213-8616","authenticated-orcid":false,"given":"Gy\u00f6rgy","family":"Vaszil","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, University of Debrecen, Kassai \u00fat 26, 4028 Debrecen, Hungary"}]}],"member":"219","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"S0129054125430038BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.071"},{"key":"S0129054125430038BIB002","first-page":"347","volume":"12","author":"Bordihn H.","year":"1996","journal-title":"Acta Cybern."},{"key":"S0129054125430038BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74240-1_11"},{"key":"S0129054125430038BIB004","first-page":"49","volume":"26","author":"Csuhaj-Varj\u00fa E.","year":"1990","journal-title":"Journ. Inform. Process. and Cybern."},{"key":"S0129054125430038BIB005","volume-title":"Grammar Systems. A Grammatical Approach to Distribution and Cooperation","author":"Csuhaj-Varj\u00fa E.","year":"1994"},{"key":"S0129054125430038BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S012905419900006X"},{"key":"S0129054125430038BIB007","first-page":"361","volume":"43","author":"Dassow J.","year":"1998","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"S0129054125430038BIB008","first-page":"19","volume":"15","author":"Dassow J.","year":"1990","journal-title":"Found. Control Eng."},{"key":"S0129054125430038BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07675-0_4"},{"key":"S0129054125430038BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07675-0_3"},{"key":"S0129054125430038BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2"},{"key":"S0129054125430038BIB012","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321403"},{"key":"S0129054125430038BIB013","doi-asserted-by":"publisher","DOI":"10.1145\/321371.321385"},{"key":"S0129054125430038BIB014","volume-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft J. E.","year":"1969"},{"key":"S0129054125430038BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_5"},{"key":"S0129054125430038BIB016","first-page":"795","volume":"16","author":"Lange K.-J.","year":"2009","journal-title":"Journ. Univ. Comp. Sci."},{"key":"S0129054125430038BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08921-7_84"},{"key":"S0129054125430038BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.5"},{"key":"S0129054125430038BIB019","volume-title":"The Mathematical Theory of L Systems","author":"Rozenberg G.","year":"1980"},{"key":"S0129054125430038BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"},{"key":"S0129054125430038BIB021","doi-asserted-by":"publisher","DOI":"10.1080\/00207167608803118"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125430038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T03:17:37Z","timestamp":1745551057000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125430038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,18]]},"references-count":21,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["10.1142\/S0129054125430038"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125430038","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,18]]}}}