{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:00:14Z","timestamp":1784307614504,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372134","type":"print"},{"value":"9783540372141","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_14","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"137-149","source":"Crossref","is-referenced-by-count":8,"title":["On the Computation of Some Standard Distances Between Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Corinna","family":"Cortes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Rastogi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Berlin (1988)"},{"key":"14_CR2","volume-title":"Iteration Theories","author":"S. Bloom","year":"1991","unstructured":"Bloom, S., \u00c9sik, Z.: Iteration Theories. Springer, Berlin (1991)"},{"key":"14_CR3","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.: Distances between Probabilistic Automata. Preparation journal version (2006)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/11682462_32","volume-title":"LATIN 2006: Theoretical Informatics","author":"C. Cortes","year":"2006","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.D.: Efficient Computation of the Relative Entropy of Probabilistic Automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 323\u2013336. Springer, Heidelberg (2006)"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/978-3-642-59126-6_10","volume-title":"Handbook of Formal Languages","author":"K. Culik II","year":"1997","unstructured":"Culik II, K., Kari, J.: Digital Images and Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 599\u2013616. Springer, Heidelberg (1997)"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.J.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge (1998)"},{"key":"14_CR7","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A\u2013B. Academic Press, London (1974-1976)"},{"key":"14_CR8","unstructured":"Eisner, J.: Expectation Semirings: Flexible EM for Finite-State Transducers. In: Proceedings of the ESSLLI Workshop on Finite-State Methods in NLP (2001)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45022-X_2","volume-title":"Automata, Languages and Programming","author":"L. Engebretsen","year":"2000","unstructured":"Engebretsen, L., Holmerin, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009o(1). In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 2\u201312. Springer, Heidelberg (2000)"},{"key":"14_CR10","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. In: EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Berlin (1986)"},{"key":"14_CR11","unstructured":"Mohri, M.: Finite-State Transducers in Language and Speech Processing. Computational Linguistics\u00a023(2) (1997)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1142\/S0129054102000996","volume":"13","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Generic Epsilon-Removal and Input Epsilon-Normalization Algorithms for Weighted Transducers. International Journal of Foundations of Computer Science\u00a013(1), 129\u2013143 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"14_CR13","first-page":"321","volume":"7","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics\u00a07(3), 321\u2013350 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"14_CR14","volume-title":"Introduction to probabilistic automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to probabilistic automata. Academic Press, New York (1971)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/S0022-0000(02)00009-0","volume":"65","author":"R.B. Lyngs\u00f8","year":"2002","unstructured":"Lyngs\u00f8, R.B., Pederson, C.N.S.: The Consensus String Problem and the Complexity of Comparing Hidden Markov Models. Journal of Computer and System Sciences\u00a065(3), 545\u2013569 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, Heidelberg (1978)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.-P.: On the definition of a family of automata. Information and Control\u00a04 (1961)","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"14_CR18","first-page":"627","volume-title":"FOCS 1996: Proceedings of the 37th Annual Symposium on Foundations of Computer Science","author":"J. H\u00e5stad","year":"1996","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . In: FOCS 1996: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 627. IEEE Computer Society, Los Alamitos (1996)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Tzeng, W.-G.: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata. Foundations of Computer Science (FOCS), 216\u2013227 (1992)","DOI":"10.1137\/0221017"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:57Z","timestamp":1605644037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11812128_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}