{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:30:19Z","timestamp":1767900619238,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"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":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90321-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"137-145","source":"Crossref","is-referenced-by-count":28,"title":["Limitedness theorem on finite automata with distance functions: an algebraic proof"],"prefix":"10.1016","volume":"81","author":[{"given":"Hing","family":"Leung","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90321-R_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(91)90321-R_BIB2","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(91)90321-R_BIB3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","article-title":"Multitape one-way nonwriting automata","volume":"2","author":"Fischer","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90321-R_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(86)90101-5","article-title":"On the decidability of some problems about rational subsets of free partially commutative monoids","volume":"48","author":"Gibbons","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90321-R_BIB5","doi-asserted-by":"crossref","unstructured":"J. Goldstine, C.M.R. Kintala and D. Wotschke, On measuring nondeterminism in regular languages, Inform. and Comput., to appear.","DOI":"10.1016\/0890-5401(90)90053-K"},{"key":"10.1016\/0304-3975(91)90321-R_BIB6","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(91)90321-R_BIB7","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(91)90321-R_BIB8","doi-asserted-by":"crossref","first-page":"199","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(91)90321-R_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","article-title":"Improved limitedness theorem on finite automata with distance functions","volume":"72","author":"Hashiguchi","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90321-R_BIB10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02573140","article-title":"On the topological structure of a finitely generated semigroup of matrices","volume":"37","author":"Leung","year":"1988","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(91)90321-R_BIB11","first-page":"143","article-title":"Limited subsets of a free monoid","author":"Simon","year":"1978","journal-title":"Proc. Nineteenth Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190321R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190321R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:07Z","timestamp":1555113187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190321R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["030439759190321R"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90321-r","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}