乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:28Z","timestamp":1726410088031},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_50","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"537-547","source":"Crossref","is-referenced-by-count":0,"title":["Multiple Usage of Random Bits in Finite Automata"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"50_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences\u00a036(2), 254\u2013276 (1988)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Barzdin, J.M.: On a Class of Turing Machines (Minsky Machines). Algebra i Logika\u00a03(1) (1963) (Russian)","key":"#cr-split#-50_CR2.1"},{"unstructured":"Review in the Journal of Symbolic Logic 32(4), 523-524 (1967)","key":"#cr-split#-50_CR2.2"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/malq.200310130","volume":"51","author":"C.S. Calude","year":"2005","unstructured":"Calude, C.S., Staiger, L.: Generalisations of disjunctive sequences. Mathematical Logic Quarterly\u00a051(2), 120\u2013128 (2005)","journal-title":"Mathematical Logic Quarterly"},{"issue":"4","key":"50_CR4","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers I: the power of interaction. Journal of the Association for Computing Machinery\u00a039(4), 800\u2013828 (1992)","journal-title":"Journal of the Association for Computing Machinery"},{"unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) SIAM-AMS Proceedings of the Complexity of Computation, vol.\u00a07, pp. 27\u201341 (1974)","key":"50_CR5"},{"key":"50_CR6","first-page":"839","volume-title":"Information Processing 1977, Proceedings of IFIP Congress 1977","author":"R. Freivalds","year":"1977","unstructured":"Freivalds, R.: Probabilistic machines can use less running time. In: Gilchrist, B. (ed.) Information Processing 1977, Proceedings of IFIP Congress 1977, pp. 839\u2013842. North-Holland, Amsterdam (1977)"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-10856-4_72","volume-title":"Mathematical Foundations of Computer Science 1981","author":"R. Freivalds","year":"1981","unstructured":"Freivalds, R.: Probabilistic Two-way Machines. In: Gruska, J., Chytil, M.P. (eds.) MFCS 1981. LNCS, vol.\u00a0118, pp. 33\u201345. Springer, Heidelberg (1981)"},{"key":"50_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: Barzdins, J., Bjorner, D. (eds.) Baltic Computer Science. LNCS, vol.\u00a0502, pp. 565\u2013613. Springer, Heidelberg (1991)"},{"issue":"3","key":"50_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"},{"issue":"38-39","key":"50_CR10","doi-asserted-by":"publisher","first-page":"3436","DOI":"10.1016\/j.tcs.2010.05.038","volume":"411","author":"R. Freivalds","year":"2010","unstructured":"Freivalds, R.: Amount of nonconstructivity in finite automata. Theoretical Computer Science\u00a0411(38-39), 3436\u20133443 (2010)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge complexity of interactive proof-systems. In: Proceedings of ACM STOC 1985, pp. 291\u2013304 (1985)","key":"50_CR11","DOI":"10.1145\/22145.22178"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of ACM STOC 1986, pp. 58\u201368 (1986)","key":"50_CR12","DOI":"10.1145\/12130.12137"},{"key":"50_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-1-4612-0539-5_8","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity, pp. 113\u2013119. Springer, New York (1999)"},{"issue":"5","key":"50_CR14","first-page":"359","volume":"12","author":"H. J\u00fcrgensen","year":"1983","unstructured":"J\u00fcrgensen, H., Thierrin, G.: On \u03c9-Languages whose syntactic monoid is trivial. International Journal of Parallel Programming\u00a012(5), 359\u2013365 (1983)","journal-title":"International Journal of Parallel Programming"},{"key":"50_CR15","first-page":"191","volume":"28","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M., Lipton, R.: Turing machines that take advice. L\u2019 Enseignement Mathematique\u00a028, 191\u2013209 (1982)","journal-title":"L\u2019 Enseignement Mathematique"},{"key":"50_CR16","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems in Information Transmission\u00a01, 1\u20137 (1965)","journal-title":"Problems in Information Transmission"},{"key":"50_CR17","first-page":"1413","volume":"14","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: On the notion of a random sequence. Soviet Mathematics Doklady\u00a014, 1413\u20131416 (1973)","journal-title":"Soviet Mathematics Doklady"},{"issue":"6","key":"50_CR18","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer (1997)","key":"50_CR19","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"50_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters\u00a039, 67\u201371 (1991)","journal-title":"Information Processing Letters"},{"issue":"4","key":"50_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2004.02.005","volume":"90","author":"H. Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: Polynomial time quantum computation with advice. Information Processing Letters\u00a090(4), 195\u2013204 (2004)","journal-title":"Information Processing Letters"},{"key":"50_CR22","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, 230\u2013245 (1963)","journal-title":"Information and Control"},{"issue":"3","key":"50_CR23","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/BF01694181","volume":"5","author":"C.-P. Schnorr","year":"1971","unstructured":"Schnorr, C.-P.: A unified approach to the definition of random sequences. Mathematical Systems Theory\u00a05(3), 246\u2013258 (1971)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"50_CR24","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C.-P. Schnorr","year":"1973","unstructured":"Schnorr, C.-P.: Process complexity and effective random tests. Journal of Computer and System Sciences\u00a07(4), 376\u2013388 (1973)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"50_CR25","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"50_CR26","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2009.08.031","volume":"411","author":"K. Tadaki","year":"2010","unstructured":"Tadaki, K., Yamakami, T., Lin, J.C.H.: Theory of one-tape linear-time Turing machines. Theoretical Computer Science\u00a0411(1), 22\u201343 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"50_CR27","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1142\/S0129054110007659","volume":"21","author":"T. Yamakami","year":"2010","unstructured":"Yamakami, T.: The Roles of Advice to One-Tape Linear-time Turing machines and finite automata. International Journal of Foundations of Computer Science\u00a021(6), 941\u2013962 (2010)","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:25:42Z","timestamp":1725542742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}