{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:40Z","timestamp":1725663580210},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:35Z","timestamp":1330207355000},"page":"225-233","source":"Crossref","is-referenced-by-count":1,"title":["A hierarchy of unary primitive recursive string-functions"],"prefix":"10.1007","author":[{"given":"Lila","family":"Santean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/malq.19600061506","volume":"6","author":"G. Asser","year":"1960","unstructured":"G. Asser. Rekursive Wortfunktionen Z.Math. Logik Grundlag.Math. 6(1960), 258\u2013278.","journal-title":"Z.Math. Logik Grundlag.Math."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-18170-9_150","volume":"270","author":"G. Asser","year":"1987","unstructured":"G. Asser. Primitive recursive word-functions of one variable, in E.Borger (ed.), Computation Theory and Logic, LNCS 270, Springer 1987, 14\u201319.","journal-title":"Computation Theory and Logic, LNCS"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/malq.19880340407","volume":"34","author":"G. Asser","year":"1988","unstructured":"G. Asser. Zur Robinson Charakterisierung der Einstelligen Primitiv Rekursiven Wortfunktionen, Z.Math.Logik Grundlag.Math., 34(1988), 317\u2013322.","journal-title":"Z.Math.Logik Grundlag.Math."},{"key":"19_CR4","volume-title":"Theories of Computational Complexity","author":"C. Calude","year":"1988","unstructured":"C. Calude. Theories of Computational Complexity, North-Holland, Amsterdam, New-York, Oxford, Tokio, 1988."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"C.Calude, L.Santean. On a Theorem of Gunter Asser, Z.Math.Logik Grundlag.Math., 1990.","DOI":"10.1002\/malq.19900360207"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02242369","volume":"15","author":"F.W. v.Henke","year":"1975","unstructured":"F.W. v.Henke, K. Indermark, G. Rose, K. Weichrauch. On Primitive Recursive Wordfunctions, Computing 15(1975), 217\u2013234.","journal-title":"Computing"},{"key":"19_CR7","unstructured":"M.Tatarim. Darboux property and one-argument primitive recursive string-functions, Revue Roumaine des Mathematiques Pures et Appliques, 1987, 79\u201394."},{"key":"19_CR8","first-page":"1","volume":"91","author":"K. Weichrauch","year":"1974","unstructured":"K. Weichrauch. Teilklassen primitiv-rekursiver Wortfunktionen, Berichte der GMD 91(1974), 1\u201349.","journal-title":"Berichte der GMD"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:49:56Z","timestamp":1605646196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}