{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:11:50Z","timestamp":1743063110561,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_23","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"267-278","source":"Crossref","is-referenced-by-count":3,"title":["Two Recursively Inseparable Problems for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Gimbert","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Horn","sequence":"additional","affiliation":[]},{"given":"Youssouf","family":"Oualhadj","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2108242.2108243","volume":"59","author":"C. Baier","year":"2012","unstructured":"Baier, C., Bertrand, N., Gr\u00f6\u00dfer, M.: Probabilistic \u03c9-automata. Journal of the ACM\u00a059(1), 1 (2012)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Bertoni, A., Mauri, G., Torelli, M.: Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052, pp. 87\u201394. Springer, Heidelberg (1977)","key":"23_CR2","DOI":"10.1007\/3-540-08342-1_7"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science, 3(3) (2007)","key":"23_CR3","DOI":"10.2168\/LMCS-3(3:4)2007"},{"doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: Foundations of Computer Science, pp. 462\u2013467 (1989)","key":"23_CR4","DOI":"10.1109\/SFCS.1989.63519"},{"doi-asserted-by":"crossref","unstructured":"Culik, K., Kari, J.: Digital images and formal languages, pp. 599\u2013616. Springer-Verlag New York, Inc. (1997)","key":"23_CR5","DOI":"10.1007\/978-3-642-59126-6_10"},{"doi-asserted-by":"crossref","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (July 1999)","key":"23_CR6","DOI":"10.1017\/CBO9780511790492"},{"doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: Logics in Computer Science, pp. 295\u2013304 (2012)","key":"23_CR7","DOI":"10.1109\/LICS.2012.40"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H. Gimbert","year":"2010","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: Decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-22110-1_42","volume-title":"Computer Aided Verification","author":"S. Kiefer","year":"2011","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: Language equivalence for probabilistic automata. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 526\u2013540. Springer, Heidelberg (2011)"},{"key":"23_CR10","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023, 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"unstructured":"Paz, A.: Introduction to probabilistic automata. Academic Press (1971)","key":"23_CR11"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.-P.: On the definition of a family of automata. Information and Control,\u00a04 (1961)","key":"23_CR13","DOI":"10.1016\/S0019-9958(61)80020-X"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W.-G. Tzeng","year":"1992","unstructured":"Tzeng, W.-G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing\u00a021(2), 216\u2013227 (1992)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T20:19:52Z","timestamp":1676405992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}