{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T02:47:11Z","timestamp":1768704431930,"version":"3.49.0"},"reference-count":22,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1051\/ita\/2014010","type":"journal-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T15:37:06Z","timestamp":1401205026000},"page":"281-305","source":"Crossref","is-referenced-by-count":7,"title":["A general framework for the derivation of regular expressions"],"prefix":"10.1051","volume":"48","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":"250","published-online":{"date-parts":[[2014,5,27]]},"reference":[{"key":"R1","unstructured":"Antimirov V., Partial derivatives of regular expressions and finite automaton constructions.Theoret. Comput. Sci.155(1996) 291\u2013319."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Antimirov V.M. and Mosses P.D., Rewriting extended regular expressions.Theoret. Comput. Sci.143(1995) 51\u201372.","DOI":"10.1016\/0304-3975(95)80024-4"},{"key":"R3","unstructured":"Berry G. and Sethi R., From regular expressions to deterministic automata.Theoret. Comput. Sci.48(1986) 117\u2013126."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Brzozowski J.A., Derivatives of regular expressions.J. Assoc. Comput. Mach.11(1964) 481\u2013494.","DOI":"10.1145\/321239.321249"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Brzozowski J.A., Quotient complexity of regular languages.J. Automata, Languages and Combinatorics15(2010) 71\u201389.","DOI":"10.1007\/978-3-642-13089-2_1"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Brzozowski J.A. and Leiss E.L., On equations for regular languages, finite automata, and sequential networks.Theoret. Comput. Sci.10(1980) 19\u201335.","DOI":"10.1016\/0304-3975(80)90069-9"},{"key":"R7","unstructured":"P. Caron, J.-M. Champarnaud and L. Mignot, Partial derivatives of an extended regular expression, inLATA, vol. 6638 ofLect. Notes Comput. Sci.Edited by A.H. Dediu, S. Inenaga and C. Mart\u00edn-Vide. Springer (2011) 179\u2013191."},{"key":"R8","unstructured":"Champarnaud J.-M., Ouardi F. and Ziadi D., An efficient computation of the equation K-automaton of a regular K-expression.Fundam. Inform.90(2009) 1\u201316."},{"key":"R9","unstructured":"Champarnaud J.-M. and Ziadi D., Canonical derivatives, partial derivatives, and finite automaton constructions.Theoret. Comput. Sci.239(2002) 137\u2013163."},{"key":"R10","unstructured":"J. Clarke, An algorithm for RELAX NG validation. Implementation Report (2002)."},{"key":"R11","unstructured":"J.-H. Conway,Regular algebra and finite machines. Chapman and Hall (1971)."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Ginzburg A., A procedure for checking equality of regular expressions.J. ACM14(1967) 355\u2013362.","DOI":"10.1145\/321386.321399"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Ilie L. and Yu S., Follow automata.Inf. Comput.186(2003) 140\u2013162.","DOI":"10.1016\/S0890-5401(03)00090-7"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Krob D., Differentation ofK-rational expressions.Internat. J. Algebra Comput.2(1992) 57\u201387.","DOI":"10.1142\/S0218196792000062"},{"key":"R15","unstructured":"Lombardy S. and Sakarovitch J., Derivatives of rational expressions with multiplicity.Theoret. Comput. Sci.332(2005) 141\u2013177."},{"key":"R16","unstructured":"M. Might, D. Darais and D. Spiewak, Parsing with derivatives: a functional pearl, inICFP, edited by M.M.T. Chakravarty, Zh. Hu and O. Danvy. ACM (2011) 189\u2013195."},{"key":"R17","unstructured":"J. Myhill, Finite automata and the representation of events.WADDTR-57-624(1957) 112\u2013137."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"A. Nerode, Linear automata transformation, inProc. of AMS9(1958) 541\u2013544.","DOI":"10.2307\/2033204"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Owens S., Reppy J.H. and Turon A., Regular-expression derivatives re-examined.J. Funct. Program.19(2009) 173\u2013190.","DOI":"10.1017\/S0956796808007090"},{"key":"R20","unstructured":"J. Sakarovitch, The language, the expression, and the (small) automaton, inCIAA, vol. 3845 ofLect. Notes Comput. Sci.Edited by J. Farr\u00e9, I. Litovsky and S. Schmitz. Springer (2005) 15\u201330."},{"key":"R21","unstructured":"M. Sulzmann and K.Z.M. Lu, Partial derivative regular expression pattern matching. Manuscript (2007)."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Thompson K., Regular expression search algorithm.Comm. ACM11(1968) 419\u2013422.","DOI":"10.1145\/363347.363387"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T01:28:50Z","timestamp":1565486930000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,27]]},"references-count":22,"journal-issue":{"issue":"3"},"alternative-id":["ita140013"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014010","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,27]]}}}