{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:22:22Z","timestamp":1767907342744,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01202281","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T03:05:42Z","timestamp":1111719942000},"page":"169-185","source":"Crossref","is-referenced-by-count":10,"title":["Distance automata having large finite distance or finite ambiguity"],"prefix":"10.1007","volume":"26","author":[{"given":"Andreas","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft, and J. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"CR2","volume-title":"Automata, Languages, and Machines, Volume A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg,Automata, Languages, and Machines, Volume A, Academic Press, New York, 1974."},{"key":"CR3","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson,Computers and Intractability, Freeman, San Francisco, CA, 1979."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1051\/ita\/1985190403511","volume":"19","author":"P. Gohon","year":"1985","unstructured":"P. Gohon, Automates de co\u00fbt born\u00e9 sur un alphabet \u00e0 une lettre,RAIRO Inform, th\u00e9or.,19 (1985), 351?357.","journal-title":"RAIRO Inform, th\u00e9or"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J. Goldstine","year":"1990","unstructured":"J. Goldstine, C. Kintala, and D. Wotschke, On measuring nondeterminism in regular languages,Inform. and Comput.,86 (1990), 179?194.","journal-title":"Inform. and Comput."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0890-5401(92)90014-7","volume":"100","author":"J. Goldstine","year":"1992","unstructured":"J. Goldstine, H. Leung, and D. Wotschke, On the relation between ambiguity and nondeterminism in finite automata,Inform. and Comput.,100 (1992), 261?270.","journal-title":"Inform. and Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(79)90057-4","volume":"8","author":"K. Hashiguchi","year":"1979","unstructured":"K. Hashiguchi, A decision procedure for the order of regular events,Theoret. Comput. Sci.,8 (1979), 69?72.","journal-title":"Theoret. Comput. Sci."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"K. Hashiguchi, Limitedness theorem on finite automata with distance functions,J. Comput. System Sci.,24 (1982), 233?244.","journal-title":"J. Comput. System Sci."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(83)90031-4","volume":"27","author":"K. Hashiguchi","year":"1983","unstructured":"K. Hashiguchi, Representation theorems on regular languages,J. Comput. System Sci.,27 (1983), 101?115.","journal-title":"J. Comput. System Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0890-5401(88)90033-8","volume":"78","author":"K. Hashiguchi","year":"1988","unstructured":"K. Hashiguchi, Algorithms for determining relative star height and star height,Inform. and Comput.,78 (1988), 124?169.","journal-title":"Inform. and Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","volume":"72","author":"K. Hashiguchi","year":"1990","unstructured":"K. Hashiguchi, Improved limitedness theorems on finite automata with distance functions,Theoret. Comput. Sci.,72 (1990), 27?38.","journal-title":"Theoret. Comput. Sci."},{"key":"CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesiey, Reading, MA, 1979."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(78)90425-4","volume":"37","author":"T. Ibaraki","year":"1978","unstructured":"T. Ibaraki, Finite automata having cost functions: nondeterministic models,Inform. and Control,37 (1978), 40?69.","journal-title":"Inform. and Control"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C. Kintala","year":"1980","unstructured":"C. Kintala and D. Wotschke, Amounts of nondeterminism in finite automata,Acta Inform.,13 (1980), 199?204.","journal-title":"Acta Inform."},{"key":"CR15","unstructured":"H. Leung, An Algebraic Method for Solving Decision Problems in Finite Automata Theory, Ph.D. Thesis, Pennsylvania State University, 1987."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(91)90321-R","volume":"81","author":"H. Leung","year":"1991","unstructured":"H. Leung, Limitedness theorem on finite automata with distance functions: an algebraic proof,Theoret. Comput. Sci.,81 (1991), 137?145.","journal-title":"Theoret. Comput. Sci."},{"key":"CR17","first-page":"509","volume-title":"Monoids and Semigroups with Applications","author":"H. Leung","year":"1991","unstructured":"H. Leung, On some decision problems in finite automata,Monoids and Semigroups with Applications, (J. Rhodes, ed.), World Scientific, Singapore, 1991, pp. 509?526."},{"key":"CR18","first-page":"355","volume-title":"Lecture Notes in Computer Science, Vol. 629","author":"H. Leung","year":"1992","unstructured":"H. Leung, On finite automata with limited nondeterminism,Proc. Symp. on Mathematical Foundations of Computer Science 1992, Lecture Notes in Computer Science, Vol. 629, Springer-Verlag, Berlin, 1992, pp. 355?363."},{"key":"CR19","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa,Jewels of Formal Language Theory, Pitman, London, 1981."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"I. Simon, Limited subsets of a free monoid,Proc. 19th Symp. on Foundations of Computer Science, 1978, pp. 143?150.","DOI":"10.1109\/SFCS.1978.21"},{"key":"CR21","first-page":"67","volume-title":"On Brzozowski's problem: (1 ?A)m =A*","author":"I. Simon","year":"1980","unstructured":"I. Simon, On Brzozowski's problem: (1 ?A)m =A*, Seminaire d'Informatique Th\u00e9orique 1979?1980 (M. Fontet and I. Guessarian, eds.), LITP, Universit\u00e9 Paris VI\/VII, Paris, 1980, pp. 67?72."},{"key":"CR22","first-page":"107","volume-title":"Lecture Notes in Computer Science, Vol. 324","author":"I. Simon","year":"1988","unstructured":"I. Simon, Recognizable sets with multiplicities in the tropical semiring,Proc. Symp. on Mathematical Foundations of Computer Science 1988, Lecture Notes in Computer Science, Vol. 324, Springer-Verlag, Berlin, 1988, pp. 107?120."},{"key":"CR23","series-title":"Technical Report RT-MAC-8907","volume-title":"On Semigroups of Matrices over the Tropical Semiring","author":"I. Simon","year":"1989","unstructured":"I. Simon, On Semigroups of Matrices over the Tropical Semiring, Technical Report RT-MAC-8907, 1ME, Universidade de S\u00e3o Paulo, S\u00e3o Paulo, 1989."},{"key":"CR24","first-page":"384","volume-title":"Mots","author":"I. Simon","year":"1990","unstructured":"I. Simon, The nondeterministic complexity of a finite automaton,Mots (M. Lothaire, ed.), Hermes, Paris, 1990, pp. 384?400."},{"key":"CR25","first-page":"508","volume-title":"Lecture Notes in Computer Science, Vol. 452","author":"A. Weber","year":"1990","unstructured":"A. Weber, Distance automata having large finite distance or finite ambiguity,Proc. Symp. on Mathematical Foundations of Computer Science 1990, Lecture Notes in Computer Science, Vol. 452, Springer-Verlag, Berlin, 1990, pp. 508?515."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A. Weber","year":"1991","unstructured":"A. Weber and H. Seidl, On the degree of ambiguity of finite automata,Theoret. Comput. Sci.,88 (1991), 325?349.","journal-title":"Theoret. Comput. Sci."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1991250100191","volume":"25","author":"A. Weber","year":"1991","unstructured":"A. Weber and H. Seidl, On finitely generated monoids of matrices with entries in No,RAIRO Inform. th\u00e9or. Applic.,25 (1991), 19?38.","journal-title":"RAIRO Inform. th\u00e9or. Applic."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:01:49Z","timestamp":1556715709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01202281"],"URL":"https:\/\/doi.org\/10.1007\/bf01202281","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}