{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:41:40Z","timestamp":1725910900207},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319677286"},{"type":"electronic","value":"9783319677293"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67729-3_10","type":"book-chapter","created":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T01:04:04Z","timestamp":1505523844000},"page":"155-173","source":"Crossref","is-referenced-by-count":0,"title":["Derived-Term Automata of Weighted Rational Expressions with Quotient Operators"],"prefix":"10.1007","author":[{"given":"Akim","family":"Demaille","sequence":"first","affiliation":[]},{"given":"Thibaud","family":"Michaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,17]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11821069_10","volume-title":"Mathematical Foundations of Computer Science 2006","author":"C Allauzen","year":"2006","unstructured":"Allauzen, C., Mohri, M.: A unified construction of the Glushkov, follow, and Antimirov automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 110\u2013121. Springer, Heidelberg (2006). doi:\n10.1007\/11821069_10"},{"issue":"1\/2","key":"10_CR2","first-page":"27","volume":"15","author":"P-Y Angrand","year":"2010","unstructured":"Angrand, P.-Y., Lombardy, S., Sakarovitch, J.: On the number of broken derived terms of a rational expression. J. Autom. Lang. Comb. 15(1\/2), 27\u201351 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"10_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. TCS 155(2), 291\u2013319 (1996)","journal-title":"TCS"},{"issue":"4","key":"10_CR4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-73208-2_16","volume-title":"Developments in Language Theory","author":"J-M Champarnaud","year":"2007","unstructured":"Champarnaud, J.-M., Ouardi, F., Ziadi, D.: An efficient computation of the equation \n            $$\\mathbb{K}$$\n          -automaton of a regular \n            $$\\mathbb{K}$$\n          -expression. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 145\u2013156. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-73208-2_16"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-40946-7_5","volume-title":"Implementation and Application of Automata","author":"A Demaille","year":"2016","unstructured":"Demaille, A.: Derived-term automata of multitape rational expressions. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 51\u201363. Springer, Cham (2016). doi:\n10.1007\/978-3-319-40946-7_5"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-46750-4_20","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"A Demaille","year":"2016","unstructured":"Demaille, A.: Derived-term automata for extended weighted rational expressions. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 351\u2013369. Springer, Cham (2016). doi:\n10.1007\/978-3-319-46750-4_20"},{"key":"10_CR8","unstructured":"Demaille, A.: Derived-term automata for extended weighted rational expressions. Technical report 1605.01530, arXiv, May 2016. \nhttp:\/\/arxiv.org\/abs\/1605.01530"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-39274-0_12","volume-title":"Implementation and Application of Automata","author":"A Demaille","year":"2013","unstructured":"Demaille, A., Duret-Lutz, A., Lombardy, S., Sakarovitch, J.: Implementation concepts in Vaucanson 2. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 122\u2013133. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39274-0_12"},{"key":"10_CR10","volume-title":"Equational Axioms for a Theory of Automata","author":"Z \u00c9sik","year":"2004","unstructured":"\u00c9sik, Z., Kuich, W.: Equational Axioms for a Theory of Automata. Springer, Heidelberg (2004)"},{"key":"10_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"DC Kozen","year":"1997","unstructured":"Kozen, D.C.: Automata and Computability, 1st edn. Springer, Secaucus (1997)","edition":"1"},{"key":"10_CR12","unstructured":"Li, Y., Wang, Q., Li, S.: On quotients of formal power series. Comput. Res. Repos. abs\/1203.2236 (2012)"},{"issue":"1\u20133","key":"10_CR13","doi-asserted-by":"crossref","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. TCS 332(1\u20133), 141\u2013177 (2005)","journal-title":"TCS"},{"issue":"4","key":"10_CR14","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1142\/S0218196713400146","volume":"23","author":"S Lombardy","year":"2013","unstructured":"Lombardy, S., Sakarovitch, J.: The validity of weighted automata. Int. J. Algebra Comput. 23(4), 863\u2013914 (2013)","journal-title":"Int. J. Algebra Comput."},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009). (Corrected English translation of \u00c9l\u00e9ments de th\u00e9orie des automates, Vuibert, 2003)"},{"key":"10_CR16","volume-title":"Derivatives for Enhanced Regular Expressions","author":"P Thiemann","year":"2016","unstructured":"Thiemann, P.: Derivatives for Enhanced Regular Expressions. Springer, Cham (2016)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67729-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T01:07:04Z","timestamp":1505524024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67729-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319677286","9783319677293"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67729-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}