{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:57:14Z","timestamp":1767916634635,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":[[1992,12]]},"DOI":"10.1016\/0020-0190(92)90109-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"329-331","source":"Crossref","is-referenced-by-count":2,"title":["A note on finitely ambiguous distance automata"],"prefix":"10.1016","volume":"44","author":[{"given":"Hing","family":"Leung","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90109-9_BIB1","unstructured":"J. Goldstine, H. Leung and D. Wotschke, On the relation between ambiguity and nondeterminism in finite automata , Computer Science Tech. Rept. CS-89-19, The Pennsylvania State University; also: Inform. and Comput., to appear."},{"key":"10.1016\/0020-0190(92)90109-9_BIB2","series-title":"Monoids and Semigroups with Applications","first-page":"509","article-title":"On some decision problems in finite automata","author":"Leung","year":"1991"},{"key":"10.1016\/0020-0190(92)90109-9_BIB3","series-title":"Mots - M\u00e9langes Offerts \u00e0 M.P. Sch\u00fctzenberger","first-page":"384","article-title":"The nondeterministic complexity of a finite automation","author":"Simon","year":"1990"},{"key":"10.1016\/0020-0190(92)90109-9_BIB4","first-page":"508","article-title":"Distance automata having large finite distance or finite ambiguity","volume":"452","author":"Weber","year":"1990"},{"key":"10.1016\/0020-0190(92)90109-9_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1991250100191","article-title":"On finitely generated monoids of matrices with entries in No","volume":"25","author":"Weber","year":"1991","journal-title":"RAIRO Inform. Th\u00e9or. Appl."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:35Z","timestamp":1555132895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092901099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0020019092901099"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90109-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}