{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:38Z","timestamp":1742913578493,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_5","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"101-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hidden Markov Models with\u00a0Unobservable Transitions"],"prefix":"10.1007","author":[{"given":"Rebecca","family":"Bernemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Schaffeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben","family":"Weis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abney, S.P., McAllester, D.A., Pereira, F.: Relating probabilistic grammars and automata. In: Proceedings of ACL 1999 (Annual Meeting of the Association for Computational Linguistics), pp. 542\u2013549. ACL (1999)","DOI":"10.3115\/1034678.1034759"},{"issue":"2","key":"5_CR2","first-page":"87","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counter-examples. Inf. Control 75(2), 87\u2013106 (1987)","journal-title":"Inf. Control"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/TPAMI.1983.4767370","volume":"5","author":"LR Bahl","year":"1983","unstructured":"Bahl, L.R., Jelinek, F., Mercer, R.L.: A maximum likelihood approach to continuous speech recognition. IEEE Trans. Pattern Anal. Mach. Intell. 5(2), 179\u2013190 (1983)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"5_CR4","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"LE Baum","year":"1970","unstructured":"Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41(1), 164\u2013171 (1970)","journal-title":"Ann. Math. Stat."},{"issue":"5","key":"5_CR6","first-page":"679","volume":"6","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: A markovian decision process. J. Math. Mech. 6(5), 679\u2013684 (1957)","journal-title":"J. Math. Mech."},{"key":"5_CR7","unstructured":"Bilmes, J.: A gentle tutorial of the EM algorithm and its application to parameter estimation for Gaussian mixture and Hidden Markov Models. Technical Report TR-97-021, International Computer Science Institute (1997)"},{"key":"5_CR8","unstructured":"Darwin, O., Kiefer, S.: On the sequential probability ratio test in hidden Markov models. In: Proceedings of CONCUR 2022. LIPIcs, vol. 243, pp. 9:1\u20139:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. 39(1), 1\u201338 (1977)","journal-title":"J. Roy. Stat. Soc."},{"issue":"9","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2004.03.020","volume":"38","author":"P Dupont","year":"2005","unstructured":"Dupont, P., Denis, F., Esposito, Y.: Links between probabilistic automata and Hidden Markov Models: probability distributions, learning models and induction algorithms. Pattern Recognit. 38(9), 1349\u20131371 (2005)","journal-title":"Pattern Recognit."},{"issue":"10\u201311","key":"5_CR11","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.ipl.2013.02.015","volume":"113","author":"J Esparza","year":"2013","unstructured":"Esparza, J., Gaiser, A., Kiefer, S.: A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. Inf. Process. Lett. 113(10\u201311), 381\u2013385 (2013)","journal-title":"Inf. Process. Lett."},{"key":"5_CR12","unstructured":"Esparza, J., Grande, V.P.: Black-box testing liveness properties of partially observable stochastic systems. In: Proceedings of ICALP 2023. LIPIcs, vol. 261, pp. 126:1\u2013126:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4612-4054-9","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"5_CR14","unstructured":"Grinstead, C., Laurie Snell, J.: Introduction to Probability. American Mathematical Society (1997)"},{"key":"5_CR15","unstructured":"Jelinek, F.: Statistical Methods for Speech Recognition. MIT Press (1998)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"David Forney, Jr., G.: The Viterbi algorithm. Proc. IEEE 61(3), 268\u2013278 (1973)","DOI":"10.1109\/PROC.1973.9030"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Juang, B.-H., Rabiner, L.R.: A probabilistic distance measure for hidden Markov models. AT &T Tech. J. 64(2), 391\u2013408 (1985)","DOI":"10.1002\/j.1538-7305.1985.tb00439.x"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Kiefer, S., Sistla, A.P.: Distinguishing hidden Markov chains. In: Proceedings of LICS 2016, pp. 66\u201375. ACM (2016)","DOI":"10.1145\/2933575.2933608"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Orr, J., Tadepalli, P., Doppa, J., Fern, X., Dietterich, T.: Learning scripts as hidden Markov models. Proc. AAAI Conf. Artif. Intell. 28(1) (2018)","DOI":"10.1609\/aaai.v28i1.8940"},{"key":"5_CR20","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Rabiner, L.R.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77(2), 257\u2013286 (1989)","DOI":"10.1109\/5.18626"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Schaffeld, M., Bernemann, R., Weis, T., K\u00f6nig, B., Matkovic, V.: Lifecycle-based view on cyber-physical system models using extended hidden Markov models (work-in-progress paper). In: Proceedings of MEMOCODE 2022. IEEE (2022)","DOI":"10.1109\/MEMOCODE57689.2022.9954592"},{"key":"5_CR23","unstructured":"Akshay, E.F.S., Bazille, H., Genest, B.: Classification among hidden Markov models. In: Proceedings of FSTTCS 1919. LIPIcs, vol. 150, pp. 29:1\u201329:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"A Viterbi","year":"1967","unstructured":"Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13(2), 260\u2013269 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Westhead, D.R., Vijayabaskar, M.S. (eds.): Hidden Markov Models: Methods and Protocols. Springer, New York (2017)","DOI":"10.1007\/978-1-4939-6753-7"}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:03:08Z","timestamp":1730930588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}