{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:17:01Z","timestamp":1767903421127,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90044-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"27-38","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":41,"title":["Improved limitedness theorems on finite automata with distance functions"],"prefix":"10.1016","volume":"72","author":[{"given":"Kosaburo","family":"Hashiguchi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90044-I_BIB1","article-title":"Series rationelles d'image finie","author":"Choffrut","year":"1979","journal-title":"Rapport LITP 79-6"},{"key":"10.1016\/0304-3975(90)90044-I_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(79)90057-4","article-title":"A decision procedure for the order of regular events","volume":"8","author":"Hashiguchi","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90044-I_BIB3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","article-title":"Limitedness theorem on finite automata with distance functions","volume":"24","author":"Hashiguchi","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90044-I_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(83)90031-4","article-title":"Representation theorems on regular languages","volume":"27","author":"Hashiguchi","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90044-I_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(82)91028-2","article-title":"Regular languages of star height one","volume":"53","author":"Hashiguchi","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90044-I_BIB6","series-title":"Automata, Languages and Programming","first-page":"87","article-title":"Finite power property of regular languages","author":"Linna","year":"1973"},{"key":"10.1016\/0304-3975(90)90044-I_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-16761-7_74","article-title":"Torsion, matrix semigroups and recognizable transductions","author":"Mascle","year":"1986","journal-title":"Proc. 13th Internat. Coll. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(90)90044-I_BIB8","first-page":"143","article-title":"Limitedness subsets of a free monoid","author":"Simon","year":"1978","journal-title":"Proc. 19th Ann. Symp. Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090044I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090044I?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:20Z","timestamp":1757477900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090044I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090044I"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90044-i","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved limitedness theorems on finite automata with distance functions","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90044-I","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}