{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T04:09:16Z","timestamp":1745554156484},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029963","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"199-208","source":"Crossref","is-referenced-by-count":1,"title":["Distances between languages and reflexivity of relations"],"prefix":"10.1007","author":[{"given":"Christian","family":"Choffrut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"20_CR1","unstructured":"S. Eilenberg. Automata, languages and machines, volume A. Academic Press, 1974."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. Theoretical Computer Science, 108:45\u201382, 1993.","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16:285\u2013296, 1966.","journal-title":"Pacific Journal of Mathematics"},{"key":"20_CR4","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences, 24:233\u2013244, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR5","doi-asserted-by":"publisher","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. Theoretical Computer Science, 72:27\u201338, 1990.","journal-title":"Theoretical Computer Science"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(86)90132-5","volume":"47","author":"J. Johnson","year":"1986","unstructured":"J. Johnson. Rational equivalence relations. Theoretical Computer Science, 47:39\u201360, 1986.","journal-title":"Theoretical Computer Science"},{"key":"20_CR7","unstructured":"J. Kruskal.An overview of sequence comparison.In D. Sankoff and J. Kruskal, editors, Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, pages 1\u201344. Addison-Wesley, 1983."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop, 3:125\u2013144, 1959. Also in: E.F. Moore. Sequential machines. Addison-Wesley, 1964.","journal-title":"IBM J. Res. Develop"},{"key":"20_CR9","first-page":"579","volume":"21","author":"K. Ruohonen","year":"1985","unstructured":"K. Ruohonen. Reversible machines and Post's correspondence problem for biprefix morphisms. J. Inform. Process. Cybernet. EIK, 21:579\u2013595, 1985.","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(94)90287-9","volume":"134","author":"A. Weber","year":"1994","unstructured":"A. Weber. Finite-valued distance automata. Theoretical Computer Science, 134:225\u2013251, 1994.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:57:08Z","timestamp":1549436228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0029963","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}