{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:19Z","timestamp":1725518839675},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_26","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T04:07:12Z","timestamp":1363320432000},"page":"287-298","source":"Crossref","is-referenced-by-count":1,"title":["On the Size Complexity of Deterministic Frequency Automata"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Zeugmann","sequence":"additional","affiliation":[]},{"given":"Grant R.","family":"Pogosyan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0016230","volume-title":"Mathematical Foundations of Computer Science 1986","author":"F.M. Ablaev","year":"1986","unstructured":"Ablaev, F.M., Freivalds, R.: Why Sometimes Probabilistic Algorithms Can Be More Effective. In: Wiedermann, J., Gruska, J., Rovan, B. (eds.) MFCS 1986. LNCS, vol.\u00a0233, pp. 1\u201314. Springer, Heidelberg (1986)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2004.09.007","volume":"330","author":"H. Austinat","year":"2005","unstructured":"Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. Theoretical Computer Science\u00a0330(1), 15\u201321 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(95)00149-2","volume":"163","author":"R. Beigel","year":"1996","unstructured":"Beigel, R., Gasarch, W., Kinber, E.: Frequency computation and bounded queries. Theoretical Computer Science\u00a0163(1-2), 177\u2013192 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jcss.1997.1508","volume":"55","author":"J. Case","year":"1997","unstructured":"Case, J., Kaufmann, S., Kinber, E.B., Kummer, M.: Learning recursive functions from approximations. J. Comput. Syst. Sci.\u00a055(1), 183\u2013196 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR5","unstructured":"Degtev, A.N.: On (m,n)-computable sets. In: Moldavanskij, D.I. (ed.) Algebraic Systems, pp. 88\u201399. Ivanovo Gos. Universitet (1981) (in Russian)"},{"issue":"1","key":"26_CR6","first-page":"60","volume":"239","author":"R. Freivalds","year":"1978","unstructured":"Freivalds, R.: Recognition of languages with high probability of different classes of automata. Doklady Akademii Nauk SSSR\u00a0239(1), 60\u201362 (1978) (in Russian)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"26_CR7","first-page":"39","volume":"3","author":"R. Freivalds","year":"1982","unstructured":"Freivalds, R.: On the growth of the number of states in result of the determinization of probabilistic finite automata. Avtomatika i Vychislitel\u2019naya Tekhnika\u00a03, 39\u201342 (1982) (in Russian)","journal-title":"Avtomatika i Vychislitel\u2019naya Tekhnika"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BFb0019368","volume-title":"Baltic Computer Science","author":"R. Freivalds","year":"1991","unstructured":"Freivalds, R.: Complexity of Probabilistic Versus Deterministic Automata. In: B\u0101rzdi\u0146\u0161, J., Bj\u00f8rner, D. (eds.) Baltic Computer Science. LNCS, vol.\u00a0502, pp. 565\u2013613. Springer, Heidelberg (1991)"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0129054108005826","volume":"19","author":"R. Freivalds","year":"2008","unstructured":"Freivalds, R.: Non-constructive methods for finite probabilistic automata. International Journal of Foundations of Computer Science\u00a019(3), 565\u2013580 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Harizanov, V., Kummer, M., Owings, J.: Frequency computations and the cardinality theorem. The Journal of Symbolic Logic 57(2) (1992)","DOI":"10.2307\/2275300"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1997.2666","volume":"139","author":"M. Hinrichs","year":"1997","unstructured":"Hinrichs, M., Wechsung, G.: Time bounded frequency computations. Information and Computation\u00a0139(2), 234\u2013257 (1997)","journal-title":"Information and Computation"},{"key":"26_CR12","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison\u2013Wesley Publishing Company, Reading (1979)"},{"issue":"2","key":"26_CR13","first-page":"179","volume":"12","author":"E.B. Kinber","year":"1976","unstructured":"Kinber, E.B.: Frequency computations in finite automata. Cybernetics and Systems Analysis\u00a012(2), 179\u2013187 (1976)","journal-title":"Cybernetics and Systems Analysis"},{"key":"26_CR14","first-page":"873","volume":"13","author":"E.B. Kinber","year":"1972","unstructured":"Kinber, E.B.: Frequency calculations of general recursive predicates and frequency enumerations of sets. Soviet Mathematics Doklady\u00a013, 873\u2013876 (1972)","journal-title":"Soviet Mathematics Doklady"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.2307\/2275299","volume":"57","author":"M. Kummer","year":"1992","unstructured":"Kummer, M.: A proof of Beigel\u2019s cardinality conjecture. The Journal of Symbolic Logic\u00a057(2), 677\u2013681 (1992)","journal-title":"The Journal of Symbolic Logic"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0065-2458(08)60144-8","volume":"2","author":"R. McNaughton","year":"1961","unstructured":"McNaughton, R.: The theory of automata, a survey. Advances in Computers\u00a02, 379\u2013421 (1961)","journal-title":"Advances in Computers"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"26_CR18","unstructured":"Rose, G.F.: An extended notion of computability. In: International Congress for Logic, Methodology and Philosophy of Science, Stanford University, Stanford, California, August 24-September 2 (1960); Abstracts of contributed papers"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-45687-2_52","volume-title":"Mathematical Foundations of Computer Science 2002","author":"T. Tantau","year":"2002","unstructured":"Tantau, T.: Towards a Cardinality Theorem for Finite Automata. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 625\u2013636. Springer, Heidelberg (2002)"},{"issue":"1","key":"26_CR20","first-page":"25","volume":"2","author":"B.A. Trakhtenbrot","year":"1964","unstructured":"Trakhtenbrot, B.A.: On the frequency computation of functions. Algebra i Logika\u00a02(1), 25\u201332 (1964) (in Russian)","journal-title":"Algebra i Logika"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:29:37Z","timestamp":1557588577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}