{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:45:58Z","timestamp":1725860758212},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_5","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"51-63","source":"Crossref","is-referenced-by-count":4,"title":["Derived-Term Automata of Multitape Rational Expressions"],"prefix":"10.1007","author":[{"given":"Akim","family":"Demaille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1\/2","key":"5_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":"5_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":"5_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":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179\u2013191. Springer, Heidelberg (2011)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 $${\\mathbb{K}}$$ -automaton of a regular $${\\mathbb{K}}$$ -expression. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 145\u2013156. Springer, Heidelberg (2007)"},{"key":"5_CR7","unstructured":"Demaille, A.: Derived-term automata for extended weighted rational expressions. Technical report 1605.01530, arXiv, May 2016. http:\/\/arxiv.org\/abs\/1605.01530"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"5_CR9","first-page":"331","volume":"20","author":"RM Kaplan","year":"1994","unstructured":"Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Comput. Linguist. 20(3), 331\u2013378 (1994)","journal-title":"Comput. Linguist."},{"issue":"1\u20133","key":"5_CR10","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":"5_CR11","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF01073050","volume":"5","author":"AY Makarevskii","year":"1969","unstructured":"Makarevskii, A.Y., Stotskaya, E.D.: Representability in deterministic multi-tape automata. Cybern. Syst. Anal. 5(4), 390\u2013399 (1969)","journal-title":"Cybern. Syst. Anal."},{"issue":"2","key":"5_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program. 19(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"issue":"1\u20133","key":"5_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(02)00895-2","volume":"308","author":"JJMM Rutten","year":"2003","unstructured":"Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. TCS 308(1\u20133), 1\u201353 (2003)","journal-title":"TCS"},{"key":"5_CR14","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)"},{"issue":"6","key":"5_CR15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"}],"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-319-40946-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:50:46Z","timestamp":1498312246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}