{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:03:40Z","timestamp":1725480220750},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405054"},{"type":"electronic","value":"9783540450665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_7","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"97-108","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Busse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, Resource-bounded genericity, in: \u201cComputability, Enumerability, Unsolvability\u201d, London Math. Soc. Lect. Notes Series 224 (1996) 1\u201359, Cambridge University Press.","DOI":"10.1017\/CBO9780511629167.002"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies and E. Busse, Automatic forcing and genericity: on the diagonalization strength of finite automata, Forschungsbericht Mathematische Logik und Theoretische Informatik, Nr. 61, Universit\u00e4t Heidelberg, April 2003.","DOI":"10.1007\/3-540-45066-1_7"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies and J. Reimann, Effective Baire category concepts, in: Proc. 6th Asian Logic Conference, 13\u201329, World Scientific, 1998.","DOI":"10.1142\/9789812812940_0002"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01699457","volume":"18","author":"J.L. Balcazar","year":"1985","unstructured":"J.L. Balcazar and U. Sch\u00f6ning, Bi-immune sets for complexity classes, Mathematical Systems Theory 18 (1985) 1\u201310.","journal-title":"Mathematical Systems Theory"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1002\/malq.19820282707","volume":"28","author":"C.S. Calude","year":"1982","unstructured":"C.S. Calude, Topological size of sets of partial recursive functions, Z. Math. Logik Grundlagen Math. 28 (1982) 455\u2013462.","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90331-U","volume":"87","author":"C.S. Calude","year":"1991","unstructured":"C.S. Calude, Relativized topological size of sets of partial recursive functions, Theor. Comput. Sci. 87 (1991) 347\u2013352.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(95)00066-6","volume":"154","author":"C.S. Calude","year":"1996","unstructured":"C.S. Calude and M. Zimand, Effective category and measure in abstract complexity theory, Theor. Comput. Sci. 154 (1996) 307\u2013327.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR8","unstructured":"C.S. Calude, L. Priese, and L. Staiger, Disjunctive sequences: an overview, CDMTCS Research Report 63, October 1997."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.4064\/fm-56-3-325-345","volume":"56","author":"S. Feferman","year":"1965","unstructured":"S. Feferman, Some applications of the notions of forcing and generic sets, Fund. Math. 56 (1965) 325\u2013245.","journal-title":"Fund. Math."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"S.A. Fenner, Notions of resource-bounded category and genericity, in: Proc. 6th Structure in Complexity Theory Conference, 196\u2013212, IEEE Comput. Soc. Press, 1991.","DOI":"10.1109\/SCT.1991.160262"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"S.A. Fenner, Resource-bounded Baire category: a stronger approach, in: Proc. 10th Structure in Complexity Theory Conference, 182\u2013192, IEEE Comput. Soc. Press, 1995.","DOI":"10.1109\/SCT.1995.514856"},{"key":"7_CR12","first-page":"549","volume":"2","author":"P. Hertling","year":"1996","unstructured":"P. Hertling, Disjunctive \u03c9-words and real numbers, J. UCS 2 (1996) 549\u2013568.","journal-title":"J. UCS"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/malq.19690152004","volume":"15","author":"P.G. Hinman","year":"1969","unstructured":"P.G. Hinman, Some applications of forcing to hierarchy problems in arithmetic, Z. Math. Logik Grundlagen Math. 15 (1969) 341\u2013352.","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"C.G. Jockusch, Degrees of generic sets, in: Recursion Theory: its Generalisations and Applications, London Math. Soc. Lect. Notes Series 45 (1980) 110\u2013139, Cambridge University Press.","DOI":"10.1017\/CBO9780511629181.004"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"C.G. Jockusch, Genericity for recursively enumerable sets, in: Proc. Recursion Theory Week 1984, Lect. Notes Math. 1141 (1985) 203\u2013232, Springer-Verlag.","DOI":"10.1007\/BFb0076222"},{"key":"7_CR16","unstructured":"H. J\u00fcrgensen and G. Thierrin, Some structural properties of \u03c9-languages, 13th Nat. School with Internat. Participation \u201cApplications of Mathematics in Technology\u201d, Sofia, 1988, 56\u201363."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/0219076","volume":"19","author":"J.H. Lutz","year":"1990","unstructured":"J.H. Lutz, Category and measure in complexity classes, SIAM J. Comput. 19 (1990) 1100\u20131131.","journal-title":"SIAM J. Comput."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, The quantitative structure of exponential time, in: Proc. 8th Structure in Complexity Theory Conference, 158\u2013175, IEEE Comput. Soc. Press, 1993.","DOI":"10.1109\/SCT.1993.336530"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","volume":"136","author":"E. Mayordomo","year":"1994","unstructured":"E. Mayordomo, Almost every set in exponential time is P-bi-immune, Theor. Comput. Sci. 136 (1994) 487\u2013506.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, On the size of sets of computable functions, in: Proc. 14th IEEE Symp. on Switching and Automata Theory, 190\u2013196, IEEE Comput. Soc. Press, 1973.","DOI":"10.1109\/SWAT.1973.23"},{"key":"7_CR21","unstructured":"P. Odifreddi, Classical Recursion Theory, 1989, North-Holland."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"J. C. Oxtoby, Measure and Category, 1980, Springer-Verlag.","DOI":"10.1007\/978-1-4684-9339-9"},{"key":"7_CR23","first-page":"307","volume":"12","author":"L. Staiger","year":"1976","unstructured":"L. Staiger, Regul\u00e4re Nullmengen. Elektron. Informationsverarb. Kybernetik EIK 12 (1976) 307\u2013311.","journal-title":"Elektron. Informationsverarb. Kybernetik EIK"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L. Staiger","year":"1983","unstructured":"L. Staiger, Finite-state \u03c9-languages, J. Comput. System. Sci. 27 (1983) 434\u2013448.","journal-title":"J. Comput. System. Sci."},{"key":"7_CR25","series-title":"Lect Notes Comput Sci","first-page":"478","volume-title":"Computer Science Logic, 11th Int. Workshop, CSL\u201997","author":"L. Staiger","year":"1997","unstructured":"L. Staiger, Rich \u03c9-words and monadic second-order arithmetic, in: Computer Science Logic, 11th Int. Workshop, CSL\u201997, Lecture Notes Comput. Sci. 1414 (1997) 478\u2013490, Springer-Verlag."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"L. Staiger, How large is the set of disjunctive sequences, in: \u201cCombinatorics, Computability, Logic\u201d, Proceedings DMTCS 2001, 215\u2013225, Springer-Verlag, 2001.","DOI":"10.1007\/978-1-4471-0717-0_18"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:18:42Z","timestamp":1556137122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}