{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:40:19Z","timestamp":1737333619100,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652601"},{"type":"electronic","value":"9783540494775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49477-4_24","type":"book-chapter","created":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T12:20:24Z","timestamp":1185711624000},"page":"322-331","source":"Crossref","is-referenced-by-count":1,"title":["Regulated Grammars with Leftmost Derivation"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0019-9958(74)80038-0","volume":"24","author":"B. S. Baker","year":"1974","unstructured":"B. S. Baker. Non-context-free grammars generating context-free languages. Inf. & Contr,. 24:231\u2013246, 1974.","journal-title":"Inf. & Contr"},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"New Trends in Formal Languages","author":"H. Bordihn","year":"1997","unstructured":"H. Bordihn. A grammatical approach to the LBA problem. In Gh. P\u00c4un, A Salomaa, eds., New Trends in Formal Languages, volume 1218 of LNCS, pp. 1\u20139, 1997."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(73)90008-2","volume":"2","author":"A. Cremers","year":"1973","unstructured":"A. Cremers, H. A. Maurer, and O. Mayer. A note on leftmost restricted random context grammars. Inf. Proc. Let,. 2:31\u201333, 1973.","journal-title":"Inf. Proc. Let"},{"key":"24_CR4","unstructured":"J. Dassow, H. Fernau, and Gh. P\u00c4un. On the leftmost derivation in matrix grammars. Work in progress, 1998."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"J. Dassow and Gh. P\u00c4un. Regulated Rewriting in Formal Language Theory. Springer, 1989.","DOI":"10.1007\/978-3-642-74932-2"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"G. Dong. Grammar tools and characterizations. In Proc. 11th ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems (PODS\u201992), pp. 81\u201390, 1992.","DOI":"10.1145\/137097.137113"},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-61550-4_161","volume-title":"MFCS\u201996","author":"H. Fernau","year":"1996","unstructured":"H. Fernau. On unconditional transfer. In W. Penczek and A. Szalas, eds., MFCS\u201996, volume 1113 of LNCS, pp. 348\u2013359, 1996."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3233\/FI-1996-25102","volume":"25","author":"H. Fernau","year":"1996","unstructured":"H. Fernau. On grammar and language families. Fund. Inform., 25:17\u201334, 1996.","journal-title":"Fund. Inform"},{"issue":"2","key":"24_CR9","first-page":"79","volume":"2","author":"H. Fernau","year":"1997","unstructured":"H. Fernau. Graph-controlled grammars as language acceptors. J. Aut., Lang. and Comb., 2(2):79\u201391, 1997.","journal-title":"J. Aut., Lang. and Comb."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s002360050108","volume":"34","author":"H. Fernau","year":"1997","unstructured":"H. Fernau. Unconditional transfer in regulated rewriting. Acta Inform,. 34:837\u2013857, 1997.","journal-title":"Acta Inform"},{"key":"24_CR11","series-title":"Technical Report","first-page":"249","volume-title":"How powerful is unconditional transfer?-When UT meets AC.-","author":"H. Fernau","year":"1997","unstructured":"H. Fernau and F. Stephan. How powerful is unconditional transfer?-When UT meets AC.-. Technical Report WSI-97-7, Universit\u00c4t T\u00fcbingen (Germany), Wilhelm-Schickard-Institut f\u00fcr Informatik, 1997. Short version published in: S. Bozapalidis (ed.) Proc. of the 3rd Int. Conf. Developments in Language Theory DLT\u201997, pp. 249\u2013260."},{"key":"24_CR12","first-page":"168","volume":"38","author":"F. Hinz","year":"1989","unstructured":"F. Hinz and J. Dassow. An undecidability result for regular languages and its application to regulated rewriting. EATCS Bull,. 38:168\u2013173, 1989.","journal-title":"EATCS Bull"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0019-9958(79)90664-8","volume":"43","author":"Gh. P\u00c4un","year":"1979","unstructured":"Gh. P\u00c4un. On the generative capacity of conditional grammars. Inform. & Contr., 43:178\u2013186, 1979.","journal-title":"Inform. & Contr."},{"key":"24_CR14","first-page":"751","volume":"30","author":"Gh. P\u00c4un","year":"1985","unstructured":"Gh. P\u00c4un. On leftmost derivation restriction in regulated rewriting. Rev. Roumaine Math. Pures Appl., 30:751\u2013758, 1985.","journal-title":"Rev. Roumaine Math. Pures Appl."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. J. Rosenkrantz","year":"1969","unstructured":"D. J. Rosenkrantz. Programmed grammars and classes of formal languages. J. ACM, 16(1):107\u2013131, 1969.","journal-title":"J. ACM"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"G. Rozenberg and A. Salomaa, eds. Handbook of Formal Languages (3 volumes). Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s002360050085","volume":"34","author":"A. Ru\u0392mann","year":"1997","unstructured":"A. Ru\u0392mann. Dynamic LL(k) parsing. Acta Inform., 34(4):267\u2013289, 1997.","journal-title":"Acta Inform."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(72)90332-4","volume":"20","author":"A. Salomaa","year":"1972","unstructured":"A. Salomaa. Matrix grammars with a leftmost restriction. Inf. & Contr., 20:143\u2013149, 1972.","journal-title":"Inf. & Contr."},{"key":"24_CR19","first-page":"341","volume":"28","author":"F. J. Urbanek","year":"1983","unstructured":"F. J. Urbanek. A note on conditional grammars. Rev. Roumaine Math. Pures Appl., 28:341\u2013342, 1983.","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"24_CR20","first-page":"6","volume":"20","author":"V. Virkkunen","year":"1973","unstructured":"V. Virkkunen. On scattered context grammars. Acta Universitatis Ouluensis, Series A, 20, No. 6, 1973.","journal-title":"Acta Universitatis Ouluensis, Series A"},{"key":"24_CR21","first-page":"45","volume":"1","author":"D. Wood","year":"1973","unstructured":"D. Wood. Bicolored digraph grammar systems. RAIRO Inform. th\u00e9or. Appl., 1:45\u201350, 1973.","journal-title":"RAIRO Inform. th\u00e9or. Appl."}],"container-title":["Lecture Notes in Computer Science","SOFSEM\u2019 98: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49477-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:21:05Z","timestamp":1737332465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49477-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652601","9783540494775"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-49477-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}