{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:40:38Z","timestamp":1648780838419},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1016\/j.ipl.2005.01.014","type":"journal-article","created":{"date-parts":[[2005,2,27]],"date-time":"2005-02-27T00:43:45Z","timestamp":1109465025000},"page":"151-154","source":"Crossref","is-referenced-by-count":1,"title":["Equality sets of prefix morphisms and regular star languages"],"prefix":"10.1016","volume":"94","author":[{"given":"Vesa","family":"Halava","sequence":"first","affiliation":[]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2005.01.014_bib001","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(85)90063-0","article-title":"Test sets for morphisms with bounded delay","volume":"12","author":"Choffrut","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2005.01.014_bib002","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(82)90072-5","article-title":"A homomorphic characterization of regular languages","volume":"4","author":"Culik","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2005.01.014_bib003","unstructured":"V. Halava, T. Harju, H.J. Hoogeboom, M. Latteux, Equality sets for recursively enumerable languages, Theor. Inform. Appl., submitted for publication"},{"key":"10.1016\/j.ipl.2005.01.014_bib004","article-title":"Morphisms","volume":"vol. 1","author":"Harju","year":"1997"},{"key":"10.1016\/j.ipl.2005.01.014_bib005","first-page":"420","article-title":"On the composition of morphisms and inverse morphisms","volume":"vol. 154","author":"Latteux","year":"1983"},{"key":"10.1016\/j.ipl.2005.01.014_bib006","first-page":"579","article-title":"Reversible machines and Post's correspondence problem for biprefix morphisms","volume":"21","author":"Ruohonen","year":"1985","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"10.1016\/j.ipl.2005.01.014_bib007","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019005000347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019005000347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T12:28:00Z","timestamp":1548678480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019005000347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["S0020019005000347"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2005.01.014","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}