{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:58:48Z","timestamp":1648594728784},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T00:00:00Z","timestamp":1245801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00453-009-9330-3","type":"journal-article","created":{"date-parts":[[2009,6,23]],"date-time":"2009-06-23T13:43:40Z","timestamp":1245764620000},"page":"342-363","source":"Crossref","is-referenced-by-count":0,"title":["Resource Bounded Frequency Computations with\u00a0Three Errors"],"prefix":"10.1007","volume":"56","author":[{"given":"Ulrich","family":"Hertrampf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Minnameier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"key":"9330_CR1","unstructured":"Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. In: Proceedings of the RIMS Symposium on Algebraic Systems, Formal Languages and Computation, pp. 35\u201342, Kyoto, Japan, 2000"},{"issue":"1","key":"9330_CR2","doi-asserted-by":"crossref","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. Comput. Sci. 292(1), 33\u201343 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"9330_CR3","doi-asserted-by":"crossref","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. Comput. Sci. 163(1\u20132), 177\u2013192 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9330_CR4","unstructured":"Degtev, A.N.: On (m,n)-computable sets. In: Algebraic Systems, pp. 88\u201399 (1981) (in Russian)"},{"issue":"2","key":"9330_CR5","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2275300","volume":"57","author":"V.S. Harizanov","year":"1992","unstructured":"Harizanov, V.S., Kummer, M., Owings, J.C.: Frequency computations and the cardinality theorem. J. Symb. Log. 57(2), 682\u2013687 (1992)","journal-title":"J. Symb. Log."},{"key":"9330_CR6","unstructured":"Hinrichs, M.: H\u00e4ufigkeitsberechnungen. Diplomarbeit, Friedrich-Schiller-Universit\u00e4t Jena (1994)"},{"issue":"2","key":"9330_CR7","doi-asserted-by":"crossref","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. Inf. Comput. 139(2), 234\u2013257 (1997)","journal-title":"Inf. Comput."},{"key":"9330_CR8","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. Sov. Math. Dokl. 13, 873\u2013876 (1972)","journal-title":"Sov. Math. Dokl."},{"key":"9330_CR9","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 Log. 13, 398\u2013419 (1974) (in Russian; English translation in Algebra Log. 13, 226\u2013237 (1974))","journal-title":"Algebra Log."},{"key":"9330_CR10","first-page":"7","volume":"2","author":"E.B. Kinber","year":"1976","unstructured":"Kinber, E.B.: Frequency computations in finite automata. Kibernetika 2, 7\u201315 (1976) (in Russian; English translation in Cybernetics 12, 179\u2013187 (1976))","journal-title":"Kibernetika"},{"issue":"2","key":"9330_CR11","doi-asserted-by":"crossref","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. Symb. Log. 57(2), 677\u2013681 (1992)","journal-title":"J. Symb. Log."},{"key":"9330_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-60249-6_64","volume-title":"Proceedings of the Tenth International Congress on Fundamentals of Computation Theory (FCT 1995)","author":"M. Kummer","year":"1995","unstructured":"Kummer, M., Stephan, F.: The power of frequency computation. In: Reichel, H. (ed.) Proceedings of the Tenth International Congress on Fundamentals of Computation Theory (FCT 1995). LNCS, vol. 969, pp. 323\u2013332. Springer, Berlin (1995)"},{"key":"9330_CR13","doi-asserted-by":"crossref","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. Inf. Comput. 120, 59\u201377 (1995)","journal-title":"Inf. Comput."},{"key":"9330_CR14","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. Adv. Comput. 2, 379\u2013421 (1961)","journal-title":"Adv. Comput."},{"key":"9330_CR15","unstructured":"McNicholl, T.: The inclusion problem for generalized frequency classes. PhD thesis, George Washington University, Washington DC (1995)"},{"key":"9330_CR16","unstructured":"Rose, G.F.: An extended notion of computability. In: Abstracts of the International Congress for Logic, Methodology, and Philosophy of Science, p. 14. Stanford, California (1960)"},{"key":"9330_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/3-540-45687-2_52","volume-title":"Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Warsaw, Poland","author":"T. Tantau","year":"2002","unstructured":"Tantau, T.: Towards a cardinality theorem for finite automata. In: Diks, K., Rytter, W. (eds.) Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Warsaw, Poland. LNCS, vol. 2420, pp. 625\u2013636. Springer, Berlin (2002)"},{"key":"9330_CR18","first-page":"25","volume":"2","author":"B.A. Trakhtenbrot","year":"1963","unstructured":"Trakhtenbrot, B.A.: On the frequency computation of functions. Algebra Log. 2, 25\u201332 (1963) (in Russian)","journal-title":"Algebra Log."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9330-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9330-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9330-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:04Z","timestamp":1559123104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9330-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9330"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9330-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,24]]}}}