{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:53:20Z","timestamp":1777100000099,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":4337,"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":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00293-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:49:41Z","timestamp":1027615781000},"page":"17-34","source":"Crossref","is-referenced-by-count":10,"title":["Subset construction complexity for homogeneous automata, position automata and ZPC-structures"],"prefix":"10.1016","volume":"267","author":[{"given":"J.-M.","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00293-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(00)00293-0_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(00)00293-0_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","article-title":"Automate, a computing package for automata and finite semigroups","volume":"12","author":"Champarnaud","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB4","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(00)00293-0_BIB5","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB6","unstructured":"J.H. Johnson, A program for computing finite automata, Unpublished Report, University of Waterloo, Canada, 1986."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB7","doi-asserted-by":"crossref","unstructured":"J.H. Johnson, D. Wood, Instruction computation in subset construction, in: D. Raymond, D. Wood, S. Yu (Eds.), Automata Implementation: First Internat. Workshop on Implementing Automata, WIA\u201996, Lecture Notes in Computer Science, vol. 1260, London, Ontario, Springer, Berlin, 1997, pp. 64\u201371.","DOI":"10.1007\/3-540-63174-7_6"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB8","first-page":"3","volume":"vol. 34","author":"Kleene","year":"1956"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB9","unstructured":"T.K.S. Leslie, Efficient approaches to subset construction, Tech. Report CS-92-29, Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada, 1992."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB10","unstructured":"T.K.S. Leslie, D.R. Raymond, D. Wood, The expected performance of subset construction, non publi\u00e9, 1996."},{"key":"10.1016\/S0304-3975(00)00293-0_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(00)00293-0_BIB12","first-page":"1","article-title":"Finite automata","volume":"vol. B","author":"Perrin","year":"1990"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB13","doi-asserted-by":"crossref","unstructured":"J.-L. Ponty, D. Ziadi, J.-M. Champarnaud, A new quadratic algorithm to convert a regular expression into an automaton, in: D. Raymond, D. Wood, S. Yu (Eds.), Automata Implementation: First Internat. Workshop on Implementing Automata, WIA\u201996, Lecture Notes in Computer Science, vol. 1260, London, Ont., Springer, Berlin, 1997, pp. 109\u2013119.","DOI":"10.1007\/3-540-63174-7_9"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB14","unstructured":"J.-L. Ponty, Algorithmique et impl\u00e9mentation des automates, Th\u00e8se, Universit\u00e9 de Rouen, France, 1997."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(99)00019-5","article-title":"An efficient null-free procedure for deciding regular language membership","volume":"231","author":"Ponty","year":"2000","journal-title":"Theoret. Comput. Sci"},{"issue":"2","key":"10.1016\/S0304-3975(00)00293-0_BIB16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jsco.1994.1023","article-title":"Grail, a C++ library for automata and expressions","volume":"17","author":"Raymond","year":"1994","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB18","series-title":"Theory of Computation","author":"Wood","year":"1987"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB19","first-page":"41","article-title":"Regular languages","volume":"vol. I","author":"Yu","year":"1997"},{"key":"10.1016\/S0304-3975(00)00293-0_BIB20","first-page":"177","article-title":"Passage d'une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe, Journ\u00e9es Montoises (1995)","volume":"4","author":"Ziadi","year":"1997","journal-title":"Bull. Belg. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00293-0_BIB21","unstructured":"D. Ziadi, Algorithmique parall\u00e8le et s\u00e9quentielle des automates, Th\u00e8se, Universit\u00e9 de Rouen, France, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T15:56:42Z","timestamp":1556207802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500002930"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00293-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}