{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:20Z","timestamp":1725558800794},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_35","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"318-327","source":"Crossref","is-referenced-by-count":1,"title":["On the Density of Regular and Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hartwig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A. Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing Regular Languages with Polynomial Densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 494\u2013503. Springer, Heidelberg (1992)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N. Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite-state lanuages. Information and Control\u00a01, 91\u2013112 (1958)","journal-title":"Information and Control"},{"key":"35_CR3","volume-title":"Regular Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. In: Regular Languages, ch.\u00a02, Springer, Heidelberg (1997)"},{"key":"35_CR4","volume-title":"Introduction to Computer Theory","author":"D.I.A. Cohen","year":"1996","unstructured":"Cohen, D.I.A.: Introduction to Computer Theory. Wiley, Chichester (1996)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(87)90011-9","volume":"49","author":"P. Flajolet","year":"1987","unstructured":"Flajolet, P.: Analytic Models and Ambiguity of Context-Free Languages. Theor. Comput. Sci.\u00a049, 283\u2013309 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0304-3975(00)00152-3","volume":"255","author":"R. Incitti","year":"2001","unstructured":"Incitti, R.: The Growth Function of Context-Free Languages. Theor. Comput. Sci.\u00a0255(1-2), 601\u2013605 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR7","unstructured":"Eisman, G., Ravikumar, B.: Approximate Recognition of Non-regular Languages by Finite Automata. In: ACSC, pp. 219\u2013228 (2005)"},{"issue":"1-3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(03)00286-X","volume":"304","author":"E. Demaine","year":"2003","unstructured":"Demaine, E., L\u00f3pez-Ortiz, A., Munro, J.: On Universally Easy Classes for NP-Complete Problems. Theor. Comput. Sci.\u00a0304(1-3), 471\u2013476 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR9","unstructured":"Habermehl, P.: A Note on SLRE (2000), \n                    \n                      http:\/\/citeseer.ist.psu.edu\/375870.html"},{"key":"35_CR10","unstructured":"Hartwig, M.: Acceptance Probability of Lower Regular Languages and Problems using Little Resources. In: MMU International Symposium on Information and Communications Technologies (M2USIC 2006), Petaling Jaya, Malaysia, Nov 16 - 17 (2006)"},{"key":"35_CR11","unstructured":"Hartwig, M., Phon-Amnuaisuk, S.: Regular Languages up to Star Height 1 and the Difference Shrinking Acceptance Probability. In: Proceedings of TMFCS-08 (2008)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:30Z","timestamp":1619784990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}