{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:40Z","timestamp":1725663100988},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:37:30Z","timestamp":1330198650000},"page":"96-108","source":"Crossref","is-referenced-by-count":0,"title":["Some recent restrictions in the derivation of context-free grammars"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"P\u0102un","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"7_CR1","first-page":"61","volume":"4","author":"S. Abraham","year":"1965","unstructured":"S. Abraham, Some questions of phrase-structure grammars, Comput. Lingv., 4 (1965), 61\u201370.","journal-title":"Comput. Lingv."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(73)90917-0","volume":"23","author":"A.B. Cremers","year":"1973","unstructured":"A.B. Cremers, O. Mayer, On matrix languages, Inform. Control, 23 (1973), 86\u201396.","journal-title":"Inform. Control"},{"key":"7_CR3","unstructured":"A.B. Cremers, O. Mayer, On vector languages, Proc. Symp. Summer School Math. Found. Comp. Sci., High Tatras, 1973."},{"key":"7_CR4","unstructured":"J. Dassow, Gh. P\u0102un, The regulated rewriting in formal language theory, Akademie Verlag, Berlin (in press)."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0019-9958(68)90439-7","volume":"12","author":"I. Fri\u0161","year":"1968","unstructured":"I. Fri\u0161, Grammars with partial ordering of rules, Inform. Control, 12 (1968), 415\u2013425.","journal-title":"Inform. Control"},{"key":"7_CR6","unstructured":"M. Gheorghe, Linear valence grammars, Proc. 4th Intern. Meeting Young Comp. Sci., Smolenice, 1986."},{"key":"7_CR7","first-page":"27","volume":"29","author":"M. Gheorghe","year":"1986","unstructured":"M. Gheorghe, Gh. P\u0102un, Two (infinite ?) hierarchies of vector languages, Bull. of the EATCS, 29 (1986), 27\u201332.","journal-title":"Bull. of the EATCS"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(76)90081-5","volume":"2","author":"O.H. Ibarra","year":"1976","unstructured":"O.H. Ibarra, S.K. Sahni, C.E. Kim, Finite automata with multiplication, Th. Comp. Sci., 2 (1976), 271\u2013294.","journal-title":"Th. Comp. Sci."},{"key":"7_CR9","unstructured":"J. Kelemen, Conditional grammars. Motivations, definition and some properties, Proc. Conf. Aut. Lang. Math. Syst., Salgotarjan, 1984."},{"key":"7_CR10","unstructured":"J. Kleijn, Selective substitution grammars based on context-free productions, Doctoral Dissertation, Univ. of Leiden, 1983."},{"key":"7_CR11","unstructured":"M. Marcus, Gh. P\u0102un, Valence gsm mappings, Bull. Math. Soc. Sci. Math. R.S. Roumanie (in press)."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/S0019-9958(79)90664-8","volume":"43","author":"G. P\u0102un","year":"1979","unstructured":"Gh. P\u0102un, On the generative capacity of conditional grammars, Inform. Control, 43 (1979), 178\u2013186.","journal-title":"Inform. Control"},{"key":"7_CR13","first-page":"911","volume":"25","author":"G. P\u0102un","year":"1980","unstructured":"Gh. P\u0102un, A new generative device: valence grammars, Rev. Roum. Math. Pures Appl., 25 (1980), 911\u2013924.","journal-title":"Rev. Roum. Math. Pures Appl."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90056-8","volume":"41","author":"G. P\u0102un","year":"1985","unstructured":"Gh. P\u0102un, A variant of random context grammars: semi-conditional grammars, Th. Comp. Sci., 41 (1985), 1\u201317.","journal-title":"Th. Comp. Sci."},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. Rozenkrantz","year":"1969","unstructured":"D. Rozenkrantz, Programmed grammars and classes of formal languages, Journal of the ACM, 16 (1969), 107\u2013131.","journal-title":"Journal of the ACM"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"A. Salomaa, On some families of formal languages obtained by regulated derivations, Ann. Acad. Sci. Fenn., Ser. Al, 1970, 479.","DOI":"10.5186\/aasfm.1971.479"},{"key":"7_CR17","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal languages, Academic Press, New York, London,1973."},{"key":"7_CR18","unstructured":"A.P.J. Van der Walt, Random context languages, Symp. on Formal Languages at the MFI Oberwolfach, 1970, North-Holland, 1972, 66\u201368."}],"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_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:06Z","timestamp":1605644106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540185356_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540185352","9783540480082"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3540185356_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}