{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:57Z","timestamp":1725564597368},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_27","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"305-316","source":"Crossref","is-referenced-by-count":6,"title":["Desert Automata and the Finite Substitution Problem"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kirsten","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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\u00a024, 233\u2013244 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0019-9958(82)91028-2","volume":"53","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Regular languages of star height one. Information and Control\u00a053, 199\u2013210 (1982)","journal-title":"Information and Control"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(97)00260-0","volume":"233","author":"K. Hashiguchi","year":"2000","unstructured":"Hashiguchi, K.: New upper bounds to the limitedness of distance automata. Theoretical Computer Science\u00a0233, 19\u201332 (2000)","journal-title":"Theoretical Computer Science"},{"key":"27_CR4","unstructured":"Kirsten, D.: Desert automata I. A Burnside problem and its solution. LIAFA Technical Report 2003-020, Paris (2003)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-24727-2_19","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Kirsten","year":"2004","unstructured":"Kirsten, D.: Distance desert automata and the star height one problem. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 257\u2013272. Springer, Heidelberg (2004) (to appear)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D. Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Computation\u00a04(3), 405\u2013425 (1994)","journal-title":"Int. J. of Algebra and Computation"},{"key":"27_CR7","unstructured":"Leung, H.: An Algebraic Method for Solving Decision Problems in Finite Automata Theory. PhD thesis, Pennsylvania State Univ., Dep. of Computer Science (1987)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1017\/CBO9780511662508.007","volume-title":"Idempotency","author":"H. Leung","year":"1998","unstructured":"Leung, H.: The topological approach to the limitedness problem on distance automata. In: Gunawardena, J. (ed.) Idempotency, pp. 88\u2013111. Cambridge Univ., Cambridge (1998)"},{"issue":"1-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(03)00377-3","volume":"310","author":"H. Leung","year":"2004","unstructured":"Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi\u2019s method revisited. Theor. Comp. Science\u00a0310(1-3), 147\u2013158 (2004)","journal-title":"Theor. Comp. Science"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Pin, J.-E.: Varieties of Formal Languages. North Oxford Academic Publ. (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"27_CR11","unstructured":"Pin, J.-E.: Personal communication (2003)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Simon, I.: Limited subsets of a free monoid. In: Proceedings of the 19th IEEE Annual Symposium on Foundations of Computer Science, pp. 143\u2013150 (1978)","DOI":"10.1109\/SFCS.1978.21"},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1051\/ita\/1994283-402771","volume":"28","author":"I. Simon","year":"1994","unstructured":"Simon, I.: On semigroups of matrices over the tropical semiring. Informatique Th\u00e9orique et Applications\u00a028, 277\u2013294 (1994)","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:11:14Z","timestamp":1553044274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}