{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:19Z","timestamp":1725663199472},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_104","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:59:31Z","timestamp":1330203571000},"page":"599-605","source":"Crossref","is-referenced-by-count":2,"title":["On comparing probabilistic and deterministic automata complexity of languages"],"prefix":"10.1007","author":[{"given":"Farid M.","family":"Ablayev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"3","key":"52_CR1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. O. Rabin","year":"1963","unstructured":"M.O. Rabin. Probabilistic Automata. Information and Control, 1963, v.6, N 3, 230\u2013245.","journal-title":"Information and Control"},{"key":"52_CR2","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"A. Paz. Introduction to Probabilistic Automata. Academic Press, New York, London, 1971."},{"unstructured":"N,Z,Gabbasov. Notes About Rabin's Reduction Theorem Bounds. Dep. VINITY 25. 02.88, N 1532-B88 (Technical report in Russion ).","key":"52_CR3"},{"unstructured":"R.Freivald. On Growing the Number of States in Determinization on Finite Probabilistic Automata, Avtomatica and Vicheslitelnaya Tachnika, 1982, N 3, 39\u201342 (In Russian).","key":"52_CR4"},{"unstructured":"I.Pokrovskaya. Some Bounds of the Number of States of Probabilistic Automata Recognizing Regular Languages, Problemy Kebernetiky, 1979, N 36, 181\u2013194 (In Russian).","key":"52_CR5"},{"key":"52_CR6","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BFb0017138","volume":"324","author":"F. Ablayev","year":"1988","unstructured":"F. Ablayev. Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability, in Proc. MFCS-88, Lecture Notes in Computer Science, 1988, v. 324, 154\u2013161.","journal-title":"Lecture Notes in Computer Science"},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(88)90164-8","volume":"57","author":"F. Ablayev","year":"1988","unstructured":"F. Ablayev. The Complexity Properties of Probabilistic Automata With Isolated Cut Point. Theoret. Comput. Sci. 57, 1988, 87\u201395.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:22Z","timestamp":1619571802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}