{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:26Z","timestamp":1771024226363,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642212536","type":"print"},{"value":"9783642212543","type":"electronic"}],"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-21254-3_13","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"179-191","source":"Crossref","is-referenced-by-count":24,"title":["Partial Derivatives of an Extended Regular Expression"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0155, 291\u2013319 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoretical Computer Science\u00a048(1), 117\u2013126 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. Journal of the Association for Computing Machinery\u00a011(4), 481\u2013494 (1964)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/00207169908804865","volume":"72","author":"J.M. Champarnaud","year":"1999","unstructured":"Champarnaud, J.M., Ponty, J.L., Ziadi, D.: From regular expressions to finite automata. International Journal of Computational Mathematics\u00a072, 415\u2013431 (1999)","journal-title":"International Journal of Computational Mathematics"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"239","author":"J.M. Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives, and finite automaton constructions. Theoretical Computer Science\u00a0239(1), 137\u2013163 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR6","first-page":"407","volume":"10","author":"K. Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics\u00a010(4), 407\u2013437 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"31-33","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1016\/j.tcs.2010.04.036","volume":"411","author":"W. Gelade","year":"2010","unstructured":"Gelade, W.: Succinctness of regular expressions with interleaving, intersection and counting. Theoretical Computer Science\u00a0411(31-33), 2987\u20132998 (2010)","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol.\u00a008001, pp. 325\u2013336 (2008)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"13_CR10","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies Annual Mathematical Studies\u00a034, 3\u201341 (1956)","journal-title":"Automata Studies Annual Mathematical Studies"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1008861.1008870","volume":"12","author":"E. Leiss","year":"1980","unstructured":"Leiss, E.: Constructing a finite automaton for a given regular expression. SIGACT News\u00a012, 81\u201387 (1980)","journal-title":"SIGACT News"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R.F. McNaughton","year":"1960","unstructured":"McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers\u00a09, 39\u201357 (1960)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"13_CR13","unstructured":"Myhill, J.: Finite automata and the representation of events. Wright Air Development Command Technical Report 57-624, 112\u2013137 (1957)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automata transformation. In: Proceedings of AMS, vol.\u00a09, pp. 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:11:17Z","timestamp":1560237077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}