{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:01:04Z","timestamp":1773244864488,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212584","type":"print"},{"value":"9783540246985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_30","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"262-270","source":"Crossref","is-referenced-by-count":6,"title":["Efficiently Computing the Density of Regular Languages"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"von Oertzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Schwinghammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"The Design and analysis of algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and analysis of algorithms. Addison-Wesley, Reading (1974)"},{"key":"30_CR2","unstructured":"Berstel, J.: Sur la densit\u00e9 asymptotique de langages formels. In: ICALP, pp. 345\u2013358 (1972)"},{"key":"30_CR3","unstructured":"Bhattacharya, R.N., Waymire, E.C.: Stochastic processes with applications, New York. Wiley Series in Probability and Mathematical Statistics (1990)"},{"key":"30_CR4","unstructured":"Bodirsky, M., G\u00e4rtner, T., von Oertzen, T., Schwinghammer, J.: Efficiently computing the density of regular languages, Full version, available under http:\/\/www.informatik.hu-berlin.de\/~bodirsky\/publications"},{"key":"30_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.: Algebraic Complexity Theory. Springer, Heidelberg (1997)"},{"key":"30_CR6","volume-title":"Proc. 13th IEEE Symp. on Logic in Computer Science","author":"L. Alfaro de","year":"1998","unstructured":"de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: Proc. 13th IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"30_CR7","volume-title":"The Theory of Matrices","author":"F.R. Gantmacher","year":"1977","unstructured":"Gantmacher, F.R.: The Theory of Matrices. Chelsea Pub. Co., New York (1977)"},{"key":"30_CR8","volume-title":"A Guide to NP-completeness","author":"M. Garey","year":"1978","unstructured":"Garey, M., Johnson, D.: A Guide to NP-completeness. CSLI Press, Stanford (1978)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","volume":"57","author":"E. Grandjean","year":"1983","unstructured":"Grandjean, E.: Complexity of the first-order theory of almost all finite structures. Information and Control\u00a057, 180\u2013204 (1983)","journal-title":"Information and Control"},{"key":"30_CR10","volume-title":"LEDA. A platform for combinatorial and geometric computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA. A platform for combinatorial and geometric computing. Cambridge University Press, Cambridge (1999)"},{"key":"30_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, Heidelberg (1978)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.: Word problems requiring exponential time. In: Proc. 5th Ann. ACM Sypm. on Theory of Computing. Association of Computing Machinery, vol.\u00a01\u20139 (1972)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T11:20:45Z","timestamp":1592220045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}