{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:43Z","timestamp":1725663103299},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540185352"},{"type":"electronic","value":"9783540480082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3540185356_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:37:29Z","timestamp":1330198649000},"page":"75-95","source":"Crossref","is-referenced-by-count":4,"title":["Basic ideas of selective substitution grammars"],"prefix":"10.1007","author":[{"given":"H. C. M.","family":"Kleijn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(85)90163-X","volume":"40","author":"IJ.J. Aalbersberg","year":"1985","unstructured":"Aalbersberg, IJ.J. and G. Rozenberg, CTS systems and Petri nets, Theoretical Computer Science 40 (1985), 149\u2013162.","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(85)90069-6","volume":"41","author":"E. Dahlhaus","year":"1985","unstructured":"Dahlhaus, E. and H. Gaifman, Concerning two-adjacent context-free languages, Theoretical Computer Science 41 (1985), 169\u2013184.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","unstructured":"Dassow, J. and Gh. P\u0102un, Regulated rewriting in formal language theory, in preparation."},{"key":"6_CR4","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Real-time coordinated pair systems, Dept. of Comp. Sci., Univ. of Colorado at Boulder, Tech. Rep. CU-CS-259-83, 1983."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(86)90095-2","volume":"48","author":"A. Ehrenfeucht","year":"1987","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, On the active and full records of the use of memory in right-boundary grammars and push-down automata, Theoretical Computer Science 48 (1987) 201\u2013228.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BFb0028796","volume":"199","author":"A. Ehrenfeucht","year":"1985","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, On coordinated rewriting, Lect. Notes in Comp. Sci. 199 (1985), 100\u2013111.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.3233\/FI-1986-9405","volume":"IX","author":"A. Ehrenfeucht","year":"1986","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Computations in coordinated pair systems, Fundamentae Informaticae IX (1986), 455\u2013480.","journal-title":"Fundamentae Informaticae"},{"key":"6_CR8","first-page":"405","volume":"20","author":"A. Ehrenfeucht","year":"1986","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Coordinated pair systems. Part I: Dyck words and classical pumping, R.A.I.R.O. Informatique Theorique 20 (1986), 405\u2013424.","journal-title":"R.A.I.R.O. Informatique Theorique"},{"key":"6_CR9","first-page":"425","volume":"20","author":"A. Ehrenfeucht","year":"1986","unstructured":"Ehrenfeucht, A., Hoogeboom, H.J., and G. Rozenberg, Coordinated pair systems. Part II: Sparse structure of Dyck words and Ogden's lemma, R.A.I.R.O. Informatique Theorique 20 (1986), 425\u2013439.","journal-title":"R.A.I.R.O. Informatique Theorique"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90096-9","volume":"37","author":"A. Ehrenfeucht","year":"1985","unstructured":"Ehrenfeucht, A., Kleijn, H.C.M., and G. Rozenberg, Adding global forbidding context to context-free grammars, Theoretical Computer Science 37 (1985), 337\u2013360.","journal-title":"Theoretical Computer Science"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0019-9958(80)90492-1","volume":"46","author":"A. Ehrenfeucht","year":"1980","unstructured":"Ehrenfeucht, A., Maurer, H., and G. Rozenberg, Continuous grammars, Information and Control 46 (1980), 71\u201391.","journal-title":"Information and Control"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/00207168308803374","volume":"14","author":"J. Gonczarowski","year":"1983","unstructured":"Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Closure properties of selective substitution grammars. Part I, International Journal of Computer Mathematics 14 (1983), 19\u201342.","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/00207168308803379","volume":"14","author":"J. Gonczarowski","year":"1983","unstructured":"Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Closure properties of selective substitution grammars. Part II, International Journal of Computer Mathematics 14 (1983), 109\u2013134.","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR14","first-page":"239","volume":"6","author":"J. Gonczarowski","year":"1983","unstructured":"Gonczarowski, J., Kleijn, H.C.M., and G. Rozenberg, Grammatical constructions in selective substitution grammars, Acta Cybernetica 6 (1983), 239\u2013269.","journal-title":"Acta Cybernetica"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0022-0000(85)90046-7","volume":"30","author":"J. Gonczarowski","year":"1985","unstructured":"Gonczarowski, J. and E. Shamir, Pattern selector grammars and several parsing algorithms in the context-free style, Journal of Computer and Systems Sciences 30 (1985), 249\u2013273.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(85)90092-1","volume":"37","author":"J. Gonczarowski","year":"1985","unstructured":"Gonczarowski, J. and M.K. Warmuth, Applications of scheduling theory to formal language theory, Theoretical Computer Science 37 (1985), 217\u2013243.","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","unstructured":"Kleijn, H.C.M., Selective substitution grammars based on context-free productions, Ph.D. Thesis, University of Leiden, 1983."},{"key":"6_CR18","first-page":"240","volume":"26","author":"H.C.M. Kleijn","year":"1985","unstructured":"Kleijn, H.C.M., and G. Rozenberg, Problems P 111\u2013113, EATCS Bulletin 26 (1985), 240\u2013241.","journal-title":"EATCS Bulletin"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(81)90097-9","volume":"16","author":"H.C.M. Kleijn","year":"1981","unstructured":"Kleijn, H.C.M. and G. Rozenberg, Context-free like restrictions on selective rewriting, Theoretical Computer Science 16 (1981), 237\u2013269.","journal-title":"Theoretical Computer Science"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0019-9958(81)90657-4","volume":"48","author":"H.C.M. Kleijn","year":"1981","unstructured":"Kleijn, H.C.M. and G. Rozenberg, Sequential, continuous and parallel grammars, Information and Control 48 (1981), 221\u2013260. Corrigendum, ibidem 52 (1982), 364.","journal-title":"Information and Control"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/00207168208803337","volume":"12","author":"H.C.M. Kleijn","year":"1983","unstructured":"Kleijn, H.C.M. and G. Rozenberg, Multi grammars, International Journal of Computer Mathematics 12 (1983), 177\u2013201.","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR22","first-page":"391","volume":"20","author":"H.C.M. Kleijn","year":"1983","unstructured":"Kleijn, H.C.M. and G. Rozenberg, On the generative power of regular pattern grammars, Acta Informatica 20 (1983), 391\u2013411.","journal-title":"Acta Informatica"},{"key":"6_CR23","first-page":"455","volume":"13","author":"G. Rozenberg","year":"1977","unstructured":"Rozenberg, G., Selective substitution grammars (Towards a framework for rewriting systems). Part I: Definitions and examples, Elektronische Informationsverarbeitung und Kybernetik 13 (1977), 455\u2013463.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90086-6","volume":"37","author":"G. Rozenberg","year":"1985","unstructured":"Rozenberg, G., On coordinated selective substitutions: towards a unified theory of grammars and machines, Theoretical Computer Science 37 (1985), 31\u201350.","journal-title":"Theoretical Computer Science"},{"key":"6_CR25","volume-title":"The mathematical theory of L systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G. and A. Salomaa, The mathematical theory of L systems, Academic Press, New York, 1980."},{"key":"6_CR26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00288645","volume":"13","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G. and D. Wood, Context-free grammars with selective rewriting, Acta Informatica 13 (1980), 257\u2013268.","journal-title":"Acta Informatica"},{"key":"6_CR27","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A., Formal languages, Academic Press, New York, 1973."},{"key":"6_CR28","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(85)90143-4","volume":"39","author":"R. Siromoney","year":"1985","unstructured":"Siromoney, R. and V.R. Dare, On infinite words obtained by selective substitution grammars, Theoretical Computer Science 39 (1985), 281\u2013295.","journal-title":"Theoretical Computer Science"},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0255(81)90012-8","volume":"25","author":"R. Siromoney","year":"1981","unstructured":"Siromoney, R. and K.G. Subramanian, Selective substitution array grammars, Information Sciences 25 (1981), 73\u201383.","journal-title":"Information Sciences"},{"key":"6_CR30","unstructured":"Subramanian, K.G., On the language class of continuous grammars, unpublished manuscript (1983)."}],"container-title":["Lecture Notes in Computer Science","Trends, Techniques, and Problems in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540185356_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:12:32Z","timestamp":1640916752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540185356_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540185352","9783540480082"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3540185356_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}