{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T09:37:36Z","timestamp":1698485856775},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10790,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1984]]},"DOI":"10.1016\/0304-3975(84)90018-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"185-227","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems"],"prefix":"10.1016","volume":"29","author":[{"given":"E.","family":"Fachini","sequence":"first","affiliation":[]},{"given":"M.","family":"Napoli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90018-5_BIB1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/malq.19600061506","article-title":"Rekursive wortfunktionen","volume":"6","author":"Asser","year":"1960","journal-title":"Zeitschr.f.math. Logik und Grundl. d.Math."},{"key":"10.1016\/0304-3975(84)90018-5_BIB2","first-page":"148","article-title":"On the complexity of decision problems for classes of simple programs on strings","volume":"5","author":"Ausiello","year":"1976"},{"key":"10.1016\/0304-3975(84)90018-5_BIB3","series-title":"Proc. ICALP Conf. in Turku","first-page":"135","article-title":"Serial composition of 2-way finite-state transducers and simple programs on strings","volume":"52","author":"Chytil","year":"1977"},{"key":"10.1016\/0304-3975(84)90018-5_BIB4","series-title":"Recursiveness","author":"Eilenberg","year":"1970"},{"key":"10.1016\/0304-3975(84)90018-5_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1051\/ita\/1979130100491","article-title":"A hierarchy of primitive recursive sequence functions","volume":"13","author":"Fachini","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"5","key":"10.1016\/0304-3975(84)90018-5_BIB6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/malq.19820282705","article-title":"Comparing hierarchies of primitive recursive sequence functions","volume":"28","author":"Fachini","year":"1982","journal-title":"Zeitschr.f.math.Logik und Grundl.d.Math."},{"key":"10.1016\/0304-3975(84)90018-5_BIB7","first-page":"1325","article-title":"Quelques caract\u00e9risation des fonctions\u0308 r\u00e9cursives partielles","volume":"276","author":"Germano","year":"1973","journal-title":"C.R.Acad.Sci. Paris"},{"key":"10.1016\/0304-3975(84)90018-5_BIB8","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context-free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90018-5_BIB9","unstructured":"B. Goetze and W. Nehrlich, The number of loops necessary and sufficient for computing simple functions, Elektr. Inform. Kybernet., to appear."},{"key":"10.1016\/0304-3975(84)90018-5_BIB10","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0211035","article-title":"The equivalence problem for deterministic two-way sequential transducers is decidable","volume":"11","author":"Gurari","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90018-5_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02242369","article-title":"On primitive recursive wordfunctions","volume":"15","author":"Von Henke","year":"1975","journal-title":"Comput."},{"key":"10.1016\/0304-3975(84)90018-5_BIB12","series-title":"Automata, Languages and Programming","first-page":"549","article-title":"Hierarchies of primitive recursive wordfunctions and transductions defined by automata","author":"v. Henke","year":"1972"},{"key":"10.1016\/0304-3975(84)90018-5_BIB13","series-title":"Theoret. Comput. Sci. 3rd GI Conf.","first-page":"73","article-title":"Das Aquivalenz problem f\u00fcr Spezielle Klassen von Loop Programmen","volume":"48","author":"Huwig","year":"1977"},{"key":"10.1016\/0304-3975(84)90018-5_BIB14","article-title":"Push-down transductions as primitive recursive wordfunctions","author":"Indermark","year":"1972","journal-title":"Proc. IRIA Sem."},{"key":"10.1016\/0304-3975(84)90018-5_BIB15","article-title":"Eine Charakterisierung der Klassen L1 und R1 primitive rekursiver Wortfunktionen","volume":"63","author":"Rose","year":"1973","journal-title":"GMD Bericht"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900185?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584900185?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:28Z","timestamp":1555127428000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584900185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584900185"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90018-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}