{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:20:05Z","timestamp":1777105205144,"version":"3.51.4"},"reference-count":39,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T00:00:00Z","timestamp":1395964800000},"content-version":"vor","delay-in-days":86,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2014,3,14]]},"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p>We consider conditional tabled Lindenmayer sytems without interaction, where each table is associated with a regular set and a table can only be applied to a sentential form which is contained in its associated regular set. We study the effect to the generative power, if we use instead of arbitrary regular languages only finite, nilpotent, monoidal, combinational, definite, ordered, union-free, star-free, strictly locally testable, commutative regular, circular regular, and suffix-closed regular languages. Essentially, we prove that the hierarchy of language families obtained from conditional Lindenmayer systems with subregular conditions is almost identical to the hierarchy of families of subregular languages.<\/jats:p>","DOI":"10.1051\/ita\/2014007","type":"journal-article","created":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T21:41:42Z","timestamp":1396042902000},"page":"127-147","source":"Crossref","is-referenced-by-count":4,"title":["Conditional Lindenmayer systems   with subregular conditions:   The non-extended case"],"prefix":"10.1051","volume":"48","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Rudolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2014,3,28]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Castellanos, C. Mart\u00edn-Vide, V. Mitrana and J.M. Sempere, Solving NP-Complete Problems With Networks of Evolutionary Processors. IWANN\u201901: Proc. of the 6th International Work-Conference on Artificial and Natural Neural Networks. Vol. 2084 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin (2001) 621\u2013628.","DOI":"10.1007\/3-540-45720-8_74"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"E. Csuhaj-Varj\u00fa and A. Salomaa, Networks of Parallel Language Processors. New Trends in Formal Languages. Vol. 1218 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin (1997) 299\u2013318.","DOI":"10.1007\/3-540-62844-4_22"},{"key":"R3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02252350","volume":"19","author":"\u010culik II","year":"1977","journal-title":"Comput."},{"key":"R4","first-page":"61","volume":"34","author":"Dassow","year":"1988","journal-title":"Rostocker Mathematisches Kolloquium"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"J. Dassow, Conditional grammars with restrictions by syntactic parameters. Words, Semigroups, Transductions, edited by M. Ito, Gh. P\u0103un and Sh. Yu. World Scientific, Singapore (2001) 59\u201368.","DOI":"10.1142\/9789812810908_0005"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"J. Dassow, Subregularly controlled derivations: restrictions by syntactic parameters. Where Math., Comput. Sci., Linguistics and Biology Meet. Kluwer Academic Publishers (2001) 51\u201361.","DOI":"10.1007\/978-94-015-9634-3_5"},{"key":"R7","first-page":"109","volume":"64","author":"Dassow","year":"2005","journal-title":"Fundamenta Informaticae"},{"key":"R8","unstructured":"J. Dassow, Grammars with commutative, circular, and locally testable conditions. Automata, Formal Languages, and Related Topics \u2013 Dedicated to Ferenc G\u00e9cseg on the occasion of his 70th birthday. University of Szeged (2009) 27\u201337."},{"key":"R9","first-page":"99","volume":"25","author":"Dassow","year":"1984","journal-title":"Rostock. Math. Kolloq."},{"key":"R10","unstructured":"J. Dassow and H. Hornig, Conditional grammars with subregular conditions, in Proc. Internat. Conf. Words, Languages and Combinatorics II. World Scientific, Singapore (1994) 71\u201386."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"J. Dassow, F. Manea and B. Truthe, Networks of evolutionary processors with subregular filters, in Languages and Automata Theory and Applications. Vol. 6638 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin (2011) 262\u2013273.","DOI":"10.1007\/978-3-642-21254-3_20"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"J. Dassow, F. Manea and B. Truthe, On Contextual Grammars with Subregular Selection Languages, in Descriptional Complexity of Formal Systems. Vol. 6808 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin (2011) 135\u2013146.","DOI":"10.1007\/978-3-642-22600-7_11"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"J. Dassow and Gh. P\u0103un. Regulated Rrewriting in Formal Language Theory. Springer-Verlag, Berlin (1989).","DOI":"10.1007\/978-3-642-74932-2"},{"key":"R14","unstructured":"J. Dassow and St. Rudolf, Conditional Lindenmayer systems with subregular conditions: the extended case (Submitted)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"3261","DOI":"10.1016\/j.tcs.2009.03.005","volume":"410","author":"Dassow","year":"2009","journal-title":"Theoretical Comput. Sci."},{"key":"R16","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1142\/S0129054110007520","volume":"21","author":"Dassow","year":"2010","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"R17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-596","volume":"113","author":"Dassow","year":"2011","journal-title":"Fundamenta Informaticae"},{"key":"R18","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0019-9958(68)90439-7","volume":"12","author":"Fris","year":"1968","journal-title":"Information and Control"},{"key":"R19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01692513","volume":"2","author":"Ginsburg","year":"1968","journal-title":"Math. Syst. Theory"},{"key":"R20","unstructured":"F. G\u00e9cseg and I. Peak, Algebraic Theory of Automata. Academiai kiado, Budapest (1972)."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","volume":"9","author":"Gill","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"R22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Han","year":"2009","journal-title":"Fundamenta Informaticae"},{"key":"R23","first-page":"520","volume":"5","author":"Havel","year":"1969","journal-title":"Kybernetika"},{"key":"R24","first-page":"287","volume":"30","author":"Istrail","year":"1978","journal-title":"Stud. Cerc. Mat."},{"key":"R25","unstructured":"F. Manea and B. Truthe, Accepting Networks of Evolutionary Processors with Subregular Filters, in Automata and Formal Languages \u2013 13th International Conference AFL 2011. College of Ny\u00edregyh\u00e1za (2011) 300\u2013314."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"F. Manea and B. Truthe, On internal contextual grammars with subregular selection languages, in Descriptional Complexity of Formal Systems. Vol. 7386 of Lect. Notes Comput. Sci. Springer-Verlag, Berlin (2012) 222\u2013235.","DOI":"10.1007\/978-3-642-31623-4_17"},{"key":"R27","first-page":"1525","volume":"14","author":"Marcus","year":"1969","journal-title":"Revue Roum. Math. Pures Appl."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"C. Mart\u00edn-Vide and V. Mitrana, Networks of Evolutionary Processors: Results and Perspectives, in Molecular Computational Models: Unconventional Approaches (2005) 78\u2013114.","DOI":"10.4018\/978-1-59140-333-3.ch004"},{"key":"R29","unstructured":"R. McNaughton and S. Papert, Counter-Free Languages. M.I.T. Press (1971)."},{"key":"R30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/PGEC.1963.263534","volume":"12","author":"Perles","year":"1963","journal-title":"IEEE Trans. Electronic Comput."},{"key":"R31","doi-asserted-by":"crossref","unstructured":"G. P\u0103un, Marcus Contextual Grammars. Kluwer Publ. House, Doordrecht (1998).","DOI":"10.1007\/978-94-015-8969-7"},{"key":"R32","unstructured":"G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, New York (1980)."},{"key":"R33","doi-asserted-by":"crossref","unstructured":"G. Rozenberg and A. Salomaa, Handbook of Formal Languages. Springer-Verlag, Berlin (1997).","DOI":"10.1007\/978-3-642-59126-6"},{"key":"R34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0255(78)90025-7","volume":"14","author":"Rozenberg","year":"1978","journal-title":"Inform. Sci."},{"key":"R35","unstructured":"A. Salomaa, Formal Languages. Academic Press, New York (1973)."},{"key":"R36","unstructured":"H.J. Shyr, Free Monoids and Languages. Hon Min Book Co., Taichung, Taiwan (1991)."},{"key":"R37","first-page":"9","volume":"5","author":"Shyr","year":"1974","journal-title":"Tamkang J. Math."},{"key":"R38","unstructured":"P.H. Starke, Abstrakte Automaten. Deutscher Verlag der Wissenschaften, Berlin (1969)."},{"key":"R39","unstructured":"B. Wiedemann, Vergleich der Leistungsf\u00e4higkeit endlicher determinierter Automaten. Diplomarbeit, Universit\u00e4t Rostock (1978)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014007\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T11:58:44Z","timestamp":1630670324000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":39,"journal-issue":{"issue":"1"},"alternative-id":["ita130016"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014007","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}