{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:10:16Z","timestamp":1672258216525},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":10181,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0166-218x(85)90039-3","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:34:42Z","timestamp":1032280482000},"page":"41-56","source":"Crossref","is-referenced-by-count":11,"title":["Classes of regular and context-free languages over countably infinite alphabets"],"prefix":"10.1016","volume":"12","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90039-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(80)90050-5","article-title":"Languages sur des alphabets infinis","volume":"2","author":"Autebert","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(85)90039-3_BIB2","series-title":"Transductions and context-free languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0166-218X(85)90039-3_BIB3","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0166-218X(85)90039-3_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0166-218X(85)90039-3_BIB5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0166-218X(85)90039-3_BIB6","article-title":"Charakterisierung subrekursiver Teilklassen von Wortfunktionen \u00fcber abz\u00e4hlbar-unendlichen Alphabeten","author":"Madlener","year":"1978"},{"key":"10.1016\/0166-218X(85)90039-3_BIB7","article-title":"Kontext-freie Sprachen und Transduktionen \u00fcber abz\u00e4hlbar-unendlichen Alphabaten","author":"Otto","year":"1982"},{"key":"10.1016\/0166-218X(85)90039-3_BIB8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/malq.19650110209","article-title":"Rekursive Wortfunktionen \u00fcber unendlichen Alphabeten","volume":"11","author":"Schwenkel","year":"1965","journal-title":"Z. Math. Logik Grundl. Math."},{"key":"10.1016\/0166-218X(85)90039-3_BIB9","article-title":"Teilklassen primitiv-rekursiver Wortfunktionen","author":"Weihrauch","year":"1974"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900393?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:22:35Z","timestamp":1554830555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0166218X85900393"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90039-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}