{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:23:04Z","timestamp":1768699384986,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,5,19]],"date-time":"1998-05-19T00:00:00Z","timestamp":895536000000},"content-version":"vor","delay-in-days":383,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00140-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["From regular expressions to DFA's using compressed NFA's"],"prefix":"10.1016","volume":"178","author":[{"given":"Chang","family":"Chia-Hsiang","sequence":"first","affiliation":[]},{"given":"Robert","family":"Paige","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00140-5_BIB1","series-title":"Formal Language Theory","article-title":"Pattern matching in strings","author":"Aho","year":"1980"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB2","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB3","series-title":"Compilers Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB4","series-title":"Seminar in Concurrency","article-title":"The esterel synchronous programming language and its mathematical semantics","volume":"Vol. 197","author":"Berry","year":"1985"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB5","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."},{"key":"10.1016\/S0304-3975(96)00140-5_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","article-title":"Regular expressions into finite automata","volume":"120","author":"Br\u00fcggemann-Klein","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(96)00140-5_BIB7","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. ACM"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(94)00183-J","article-title":"Using multiset discrimination to solve language processing problems without hashing","volume":"145","author":"Cai","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00140-5_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56024-6_8","article-title":"From regular expressions to DFA's using compressed NFA's","author":"Chang","year":"1992"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB10","first-page":"88","article-title":"From regular expressions to DFA's using compressed NFA's","volume":"Vol. 644","author":"Chang","year":"1992"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB11","series-title":"Proc. 8th ACM STOC","first-page":"109","article-title":"Making data structures persistent","author":"Driscoll","year":"1986"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB12","series-title":"Proc. IEEE Conf. on Logic in Computer Science","first-page":"86","article-title":"Model checking in the propositional mu-calculus","author":"Emerson","year":"1986"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB13","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB14","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","volume":"Vol. 34","author":"Kleene","year":"1956"},{"issue":"6","key":"10.1016\/S0304-3975(96)00140-5_BIB15","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the translation of languages from left to right","volume":"8","author":"Knuth","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","article-title":"Regular expressions and state graphs for automata","volume":"EC-9","author":"McNaughton","year":"1960","journal-title":"IRA Trans. Electron. Comput."},{"key":"10.1016\/S0304-3975(96)00140-5_BIB17","first-page":"57","article-title":"Finite automata and representation of events","author":"Myhill","year":"1957","journal-title":"WADC, Tech. Rep."},{"key":"10.1016\/S0304-3975(96)00140-5_BIB18","first-page":"541","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB19","doi-asserted-by":"crossref","first-page":"114","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. Develop."},{"issue":"7","key":"10.1016\/S0304-3975(96)00140-5_BIB20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/361011.361061","article-title":"The UNIX time-sharing system","volume":"17","author":"Ritchie","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB21","unstructured":"R. Sethi, private communication, 1989."},{"key":"10.1016\/S0304-3975(96)00140-5_BIB22","series-title":"Proc. Workshop on Automating Software Design","article-title":"KIDS \u2014 A knowledge-based software development system","author":"Smith","year":"1988"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB23","series-title":"Programmer's Manual","volume":"Vol. II","year":"1989"},{"issue":"6","key":"10.1016\/S0304-3975(96)00140-5_BIB24","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","article-title":"Regular expression search algorithm","volume":"11","author":"Thompson","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB25","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/S0304-3975(96)00140-5_BIB26","series-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:45:14Z","timestamp":1759625114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596001405"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00140-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"From regular expressions to DFA's using compressed NFA's","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(96)00140-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}