{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:02:29Z","timestamp":1726408949532},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319245362"},{"type":"electronic","value":"9783319245379"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24537-9_4","type":"book-chapter","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T09:37:02Z","timestamp":1443605822000},"page":"33-36","source":"Crossref","is-referenced-by-count":0,"title":["Irregular Behaviours for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"key":"4_CR1","series-title":"IFMBE Proceedings","first-page":"9","volume-title":"Mathematical Foundations of Computer Science","author":"A Bertoni","year":"1974","unstructured":"Bertoni, A.: Mathematical methods of the theory of stochastic automata. In: Blikle, A. (ed.) Mathematical Foundations of Computer Science. IFMBE Proceedings, vol. 28, pp. 9\u201322. Springer, Heidelberg (1974)"},{"doi-asserted-by":"crossref","unstructured":"Condon, A.: Bounded error probabilistic finite state automata, chapter 1. In: Handbook on Randomized Computing, vol. II, pp. 509\u2013532. Kluwer (2001)","key":"4_CR2","DOI":"10.1007\/978-1-4615-0013-1_13"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"Hugo Gimbert","year":"2010","unstructured":"Gimbert, Hugo, Oualhadj, Youssouf: Probabilistic automata on finite words: decidable and undecidable problems. In: Abramsky, Samson, Gavoille, Cyril, Kirchner, Claude, Meyer auf der Heide, Friedhelm, Spirakis, Paul G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press (1971)","key":"4_CR4"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230\u2013245 (1963)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24537-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T03:54:27Z","timestamp":1567223667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24537-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319245362","9783319245379"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24537-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}