{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:23Z","timestamp":1771024223844,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00267-5","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"137-163","source":"Crossref","is-referenced-by-count":64,"title":["Canonical derivatives, partial derivatives and finite automaton constructions"],"prefix":"10.1016","volume":"289","author":[{"given":"J.-M.","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00267-5_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","article-title":"Partial derivatives of regular expressions and finite automaton constructions","volume":"155","author":"Antimirov","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00267-5_BIB3","series-title":"\u00c9l\u00e9ments d'Algorithmique","author":"Beauquier","year":"1992"},{"issue":"1","key":"10.1016\/S0304-3975(01)00267-5_BIB4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","article-title":"From regular expressions to deterministic automata","volume":"48","author":"Berry","year":"1986","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(01)00267-5_BIB5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","article-title":"Derivatives of regular expressions","volume":"11","author":"Brzozowski","year":"1964","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00267-5_BIB6","doi-asserted-by":"crossref","unstructured":"J.-M. Champarnaud, D. Ziadi, From C-continuations to new quadratic algorithms for automaton synthesis, Internat. J. Algebra Comput. 11 (6) (2001) 707\u2013735.","DOI":"10.1142\/S0218196701000772"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB7","unstructured":"J.-M. Champarnaud, D. Ziadi, From Mirkin's prebases to Antimirov's word partial derivatives, Fund. Inform. 45(3) (2001) 195\u2013205."},{"key":"10.1016\/S0304-3975(01)00267-5_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","article-title":"The abstract theory of automata","volume":"16","author":"Glushkov","year":"1961","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB9","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB10","doi-asserted-by":"crossref","unstructured":"S. Kleene, Representation of events in nerve nets and finite automata, Automata Studies Annals of Mathematics Studies vol. 34, 1956, Princeton University Press, Princeton NJ, pp. 3\u201341.","DOI":"10.1515\/9781400882618-002"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","article-title":"Regular expressions and state graphs for automata","volume":"9","author":"McNaughton","year":"1960","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0304-3975(01)00267-5_BIB12","first-page":"110","article-title":"An algorithm for constructing a base in a language of regular expressions","volume":"5","author":"Mirkin","year":"1966","journal-title":"Eng. Cybernet."},{"issue":"6","key":"10.1016\/S0304-3975(01)00267-5_BIB13","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00267-5_BIB14","doi-asserted-by":"crossref","unstructured":"S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. I, Words, Languages, Grammars, Springer, Berlin, 1997, pp. 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"10.1016\/S0304-3975(01)00267-5_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.36045\/bbms\/1105730628","article-title":"Passage d'une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe","volume":"4","author":"Ziadi","year":"1997","journal-title":"Bull. Belg. Math. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T17:54:04Z","timestamp":1583776444000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002675"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00267-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}