{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:37Z","timestamp":1725516817550},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_8","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"72-81","source":"Crossref","is-referenced-by-count":0,"title":["Resource Bounded Frequency Computations with Three Errors"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hertrampf","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Minnameier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00213-4","volume":"292","author":"H. Austinat","year":"2003","unstructured":"Austinat, H., Diekert, V., Hertrampf, U.: A Structural Property of Regular Frequency Computations. Theor. Comp. Sc.\u00a0292(1), 33\u201343 (2003)","journal-title":"Theor. Comp. Sc."},{"key":"8_CR2","unstructured":"Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular Frequency Computations. In: RIMS Symposium on Algebraic Systems, Formal Languages and Computation, Kyoto, Japan, pp. 35\u201342 (2000)"},{"issue":"1\u20132","key":"8_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.I., Kinber, E.B.: Frequency Computation and Bounded Queries. Theor. Comp. Sc.\u00a0163(1\u20132), 177\u2013192 (1996)","journal-title":"Theor. Comp. Sc."},{"key":"8_CR4","unstructured":"Degtev, A.N.: On (m,n)-Computable Sets. Algebraic Systems, 88\u201399 (1981) (in Russian)"},{"issue":"2","key":"8_CR5","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":"8_CR6","first-page":"873","volume":"13","author":"E.B. Kinber","year":"1972","unstructured":"Kinber, E.B.: Frequency Calculations of General Recursive Predicates and Frequency Enumeration of Sets. Soviet Mathematics Doklady\u00a013, 873\u2013876 (1972)","journal-title":"Soviet Mathematics Doklady"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/BF01463139","volume":"13","author":"E.B. Kinber","year":"1974","unstructured":"Kinber, E.B.: On Frequency-Enumerable Sets. Algebra i Logika\u00a013, 398\u2013419 (1974) (in Russian); English translation in Algebra and Logic 13, 226\u2013237 (1974)","journal-title":"Algebra i Logika"},{"key":"8_CR8","first-page":"7","volume":"2","author":"E.B. Kinber","year":"1976","unstructured":"Kinber, E.B.: Frequency Computations in Finite Automata. Kibernetika\u00a02, 7\u201315 (1976) (in Russian); English translation in Cybernetics 12, 179\u2013187 (1976)","journal-title":"Kibernetika"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-60249-6_64","volume-title":"FCT 1995","author":"M. Kummer","year":"1995","unstructured":"Kummer, M., Stephan, F.: The Power of Frequency Computation. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0969, pp. 323\u2013332. Springer, Heidelberg (1995)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1099","volume":"120","author":"M. Kummer","year":"1995","unstructured":"Kummer, M., Stephan, F.: Recursion Theoretic Properties of Frequency Computation and Bounded Queries. Information and Computation\u00a0120, 59\u201377 (1995)","journal-title":"Information and Computation"},{"issue":"2","key":"8_CR11","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. J. of Symbolic Logic\u00a057(2), 677\u2013681 (1992)","journal-title":"J. of Symbolic Logic"},{"key":"8_CR12","doi-asserted-by":"crossref","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"},{"key":"8_CR13","unstructured":"McNicholl, T.: The Inclusion Problem for Generalized Frequency Classes. PhD thesis, George Washington University, Washington (1995)"},{"key":"8_CR14","unstructured":"Rose, G.F.: An Extended Notion of Computability, Abstracts Int. Congress for Logic, Methodology, and Philosophy of Science. Stanford, California, p. 14 (1960)"},{"key":"8_CR15","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)"},{"key":"8_CR16","first-page":"25","volume":"2","author":"B.A. Trakhtenbrot","year":"1963","unstructured":"Trakhtenbrot, B.A.: On the Frequency Computation of Functions. Algebra i Logika\u00a02, 25\u201332 (1963) (in Russian)","journal-title":"Algebra i Logika"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:45:00Z","timestamp":1620017100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}