{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:00Z","timestamp":1725663600136},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558088"},{"type":"electronic","value":"9783540472919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55808-x_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:46:35Z","timestamp":1330231595000},"page":"355-363","source":"Crossref","is-referenced-by-count":0,"title":["On finite automata with limited nondeterminism (extended abstract)"],"prefix":"10.1007","author":[{"given":"Hing","family":"Leung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"issue":"No.4","key":"34_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1051\/ita\/1985190403511","volume":"19","author":"P. Gohon","year":"1985","unstructured":"Gohon P., Automates de co\u00fbt born\u00e9 sur un alphabet a une lettre, R.A.I.R.O. Informatique th\u00e9orique\n                19, No. 4, 351\u2013357, 1985.","journal-title":"R.A.I.R.O. Informatique th\u00e9orique"},{"issue":"No.2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J. Goldstine","year":"1990","unstructured":"Goldstine J., Kintala C.M.R. and Wotschke D., On Measuring Nondeterminism in Regular Languages, Information and Computation\n                86, No. 2, 179\u2013194, 1990.","journal-title":"Information and Computation"},{"key":"34_CR3","unstructured":"Goldstine J., Leung H. and Wotschke D., On the Relation between Ambiguity and Nondeterminism in Finite Automata, Computer Science Technical Report CS-89-19, The Pennsylvania State University, University Park, Pennsylvania; Information and Computation, to appear."},{"issue":"No.2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi K., Limitedness Theorem on Finite Automata with Distance Functions, Journal of Computer and System Sciences\n                24, No. 2, 233\u2013244, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","volume":"72","author":"K. Hashiguchi","year":"1990","unstructured":"Hashiguchi K., Improved Limitedness Theorem on Finite Automata with Distance Functions, Theoretical Computer Science\n                72, 27\u201338, 1990.","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C.M.R. Kintala","year":"1980","unstructured":"Kintala C.M.R. and Wotschke D., Amount of Nondeterminism in Finite Automata, Acta Informatica\n                13, 199\u2013204, 1980.","journal-title":"Acta Informatica"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02573140","volume":"37","author":"H. Leung","year":"1988","unstructured":"Leung H., On the Topological Structure of a Finitely Generated Semigroup of Matrices, Semigroup Forum\n                37, 273\u2013287, 1988.","journal-title":"Semigroup Forum"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(91)90321-R","volume":"81","author":"H. Leung","year":"1991","unstructured":"Leung H., Limitedness Theorem on Finite Automata with Distance Functions: an Algebraic Proof, Theoretical Computer Science\n                81, 137\u2013145, 1991.","journal-title":"Theoretical Computer Science"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Meyer A. and Fischer M., Economy of Description by Automata, Grammars, and Formal Systems, Proc. 12th SWAT Symposium, 188\u2013191, 1971.","DOI":"10.1109\/SWAT.1971.11"},{"key":"34_CR10","unstructured":"Simon I., The Nondeterministic Complexity of a Finite Automaton, in M. Lothaire(ed.), Mots \u2014 m\u00e9langes offerts \u00e0 M. P. Sch\u00fctzenberger, Hermes, Paris, 384\u2013400, 1990."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Simon I., Recognizable Sets with Multiplicities in the Tropical Semiring, Proc. MFCS 1988, Lecture Notes in Computer Science 324, Springer-Verlag, 107\u2013120, 1988.","DOI":"10.1007\/BFb0017135"},{"key":"34_CR12","unstructured":"Simon I., On Semigroups of Matrices over the Tropical Semiring, Technical Report RT-MAC-8907, Universidade de S\u0101o Paulo, 1989."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Weber A., Distance Automata having Large Finite Distance or Finite Ambiguity, Proc. MFCS 1990, Lecture Notes in Computer Science 452, Springer-Verlag, 508\u2013515, 1990; Mathematical System Theory, to appear.","DOI":"10.1007\/BFb0029649"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1992"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55808-X_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:36:04Z","timestamp":1619559364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55808-X_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558088","9783540472919"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-55808-x_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}