{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:28Z","timestamp":1725577408779},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_23","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"211-221","source":"Crossref","is-referenced-by-count":2,"title":["Regular Expressions on Average and in the Long Run"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingmar","family":"Meinecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Heidelberg (1988)"},{"key":"23_CR2","first-page":"1","volume-title":"Proc. Intern. Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetics. In: Proc. Intern. Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press, Stanford (1962)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-03409-1_2","volume-title":"Fundamentals of Computation Theory","author":"K. Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Alternating weighted automata. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 3\u201313. Springer, Heidelberg (2009)"},{"key":"23_CR5","first-page":"199","volume-title":"24th LICS 2009","author":"K. Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. In: 24th LICS 2009, pp. 199\u2013208. IEEE Comp. Soc. Press, Los Alamitos (2009)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-04081-8_17","volume-title":"CONCUR 2009 - Concurrency Theory","author":"K. Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic weighted automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 244\u2013258. Springer, Heidelberg (2009)"},{"key":"23_CR7","series-title":"EATCS Monographs in Theoretical Computer Science","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2006.08.024","volume":"366","author":"M. Droste","year":"2006","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series. Theoretical Computer Science\u00a0366, 199\u2013227 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1142\/S0218196707003585","volume":"17","author":"M. Droste","year":"2007","unstructured":"Droste, M., P\u00fcschmann, U.: Weighted B\u00fcchi automata with order-complete weights. Int. J. of Algebra and Computation\u00a017(2), 235\u2013260 (2007)","journal-title":"Int. J. of Algebra and Computation"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-14455-4_16","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2010","unstructured":"Droste, M., Vogler, H.: Kleene and B\u00fcchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 160\u2013172. Springer, Heidelberg (2010)"},{"key":"23_CR11","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"23_CR12","first-page":"243","volume":"10","author":"Z. \u00c9sik","year":"2005","unstructured":"\u00c9sik, Z., Kuich, W.: A semiring-semimodule generalization of \u03c9-regular languages I+II. Journal of Automata, Languages and Combinatorics\u00a010, 203\u2013242 & 243\u2013264 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"23_CR13","unstructured":"\u00c9sik, Z., Kuich, W.: Finite automata. In: Droste, et al. (eds.) [7], ch.\u00a03"},{"key":"23_CR14","first-page":"3","volume-title":"Automata Studies","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representations of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"key":"23_CR15","volume-title":"Handbook of Formal Languages","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and formal power series: their relevance to formal languages and automata. In: New Trends in Formal Languages, vol.\u00a01, ch.9. Springer, Heidelberg (1997)"},{"key":"23_CR16","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (1986)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.10.016","volume":"332","author":"S. Lombardy","year":"2005","unstructured":"Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theoretical Computer Science\u00a0332, 141\u2013177 (2005)","journal-title":"Theoretical Computer Science"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.fss.2004.12.003","volume":"153","author":"G. Rahonis","year":"2005","unstructured":"Rahonis, G.: Infinite fuzzy computations. Fuzzy Sets and Systems\u00a0153, 275\u2013288 (2005)","journal-title":"Fuzzy Sets and Systems"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)","DOI":"10.1007\/978-1-4612-6264-0"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T06:55:55Z","timestamp":1553410555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}