{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:06:59Z","timestamp":1675238819599},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T00:00:00Z","timestamp":1151971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2006,10,17]]},"DOI":"10.1007\/s00236-006-0017-9","type":"journal-article","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T23:25:20Z","timestamp":1151969120000},"page":"223-242","source":"Crossref","is-referenced-by-count":3,"title":["Programmed grammars and their relation to the LBA problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,4]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-62844-4_1","volume-title":"New Trends in Formal Languages","author":"H. Bordihn","year":"1997","unstructured":"Bordihn H. (1997). A grammatical approach to the LBA problem. In: P\u0103un Gh., Salomaa A. (eds). New Trends in Formal Languages, number 1218 in LNCS, Springer, Berlin Heidelberg New York, pp. 1\u20139"},{"key":"17_CR2","unstructured":"Bordihn, H. On a grammatical approach to the LBA problem. Technical report 5, Otto-von-Guericke-Universit\u00e4t Magdeburg, Fakult\u00e4t f\u00fcr Informatik (1999)"},{"key":"17_CR3","unstructured":"Bordihn, H., Fernau, H. (1994) Accepting grammars and systems. Technical Report 9\/94, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207169408804310","volume":"53","author":"H. Bordihn","year":"1994","unstructured":"Bordihn H., Fernau H. (1994) Accepting grammars with regulation. Int. J. Comput. Math. 53, 1\u201318","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"17_CR5","first-page":"97","volume":"1","author":"H. Bordihn","year":"1996","unstructured":"Bordihn H., Fernau H. (1996) Accepting grammars and systems via context condition grammars. J. Automata Lang. Combinatorics 1(2): 97\u2013112","journal-title":"J. Automata Lang. Combinatorics"},{"key":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated rewriting in formal language theory","author":"J. Dassow","year":"1989","unstructured":"Dassow J., P\u0103un Gh. (1989) Regulated rewriting in formal language theory, vol. 18 of EATCS Monographs in Theoretical Computer Science. Springer, Berlin Heidelberg New York"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-662-07675-0_3","volume-title":"Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"Dassow J., P\u0103un Gh., Salomaa A. (1997). Grammars with controlled derivations. In: Rozenberg G., Salomaa A. (eds). Handbook of Formal Languages, vol. II, Springer, Berlin Heidelberg New York, pp. 101\u2013154"},{"key":"17_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E., Ullman J.D. (1979) Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading"},{"issue":"2","key":"17_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.-Y. Kuroda","year":"1964","unstructured":"Kuroda S.-Y. (1964) Classes of languages and linear bounded automata. Inform. Control 7(2): 207\u2013223","journal-title":"Inform. Control"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Monien, B. On the LBA problem. In: G\u00e9cseg, F. (ed.) Proceeding of the International Conference Fundamentals on Computation Theory, number 117 in LNCS, pp. 265\u2013280. Springer, Berlin Heidelberg New York (1981)","DOI":"10.1007\/3-540-10854-8_30"},{"key":"17_CR11","volume-title":"Formal Languages","author":"A.K. Salomaa","year":"1973","unstructured":"Salomaa A.K. (1973) Formal Languages. Academic, New York"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(77)80003-X","volume":"33","author":"P.M.B. Vit\u00e1nyi","year":"1977","unstructured":"Vit\u00e1nyi P.M.B. (1977) Context sensitive table Lindenmayer languages and a relation to the LBA problem. Inform. Control 33, 217\u2013226","journal-title":"Inform. Control"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0017-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-006-0017-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0017-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:41:53Z","timestamp":1558690913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-006-0017-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,4]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10,17]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1007\/s00236-006-0017-9","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,4]]}}}