{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:10:52Z","timestamp":1767237052316,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8932,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["85-0186"],"award-info":[{"award-number":["85-0186"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006751","name":"U.S. Army","doi-asserted-by":"publisher","award":["DAAG 29-85K"],"award-info":[{"award-number":["DAAG 29-85K"]}],"id":[{"id":"10.13039\/100006751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0304-3975(89)90075-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"141-156","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Concatenation of inputs in a two-way automaton"],"prefix":"10.1016","volume":"63","author":[{"given":"Jean-Camille","family":"Birget","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1979","series-title":"Transductions and Context-free Languages","author":"Berstel","key":"10.1016\/0304-3975(89)90075-3_bib1"},{"key":"10.1016\/0304-3975(89)90075-3_bib2","unstructured":"J.C. Birget, Two-way automaton computations, RAIRO Inform. Th\u00e9or., to appear."},{"volume":"Vol. A","year":"1974","author":"Eilenberg","key":"10.1016\/0304-3975(89)90075-3_bib3"},{"year":"1969","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","key":"10.1016\/0304-3975(89)90075-3_bib4"},{"year":"1979","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","key":"10.1016\/0304-3975(89)90075-3_bib5"},{"issue":"1","key":"10.1016\/0304-3975(89)90075-3_bib6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1051\/ita\/1985190100711","article-title":"Automates boustrophedon, semigroupe de Birget et mono\u00efde inversif libre","volume":"19","author":"P\u00e9cuchet","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(89)90075-3_bib7","series-title":"Proc. Summer Institute of Symbolic Logic","first-page":"366","article-title":"Two-way automata","author":"Rabin","year":"1957"},{"issue":"2","key":"10.1016\/0304-3975(89)90075-3_bib8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"10.1016\/0304-3975(89)90075-3_bib9","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The reduction of two-way automata to one-way automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Res. Dev."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:21Z","timestamp":1757477901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0304397589900753"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90075-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1989,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Concatenation of inputs in a two-way automaton","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(89)90075-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Elsevier Science Publishers B.V.(North-Holland). Published by Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}