{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:42:58Z","timestamp":1648590178617},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0304-3975(97)00131-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"69-87","source":"Crossref","is-referenced-by-count":2,"title":["An optimal parallel algorithm to convert a regular expression into its Glushkov automaton"],"prefix":"10.1016","volume":"215","author":[{"given":"Djelloul","family":"Ziadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00131-X_BIB1","series-title":"ACM Transactions on Programming Languages and Systems","first-page":"348","article-title":"Optimal parallel generation of a computation tree form","author":"Bar-On","year":"1985"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB2","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."},{"key":"10.1016\/S0304-3975(97)00131-X_BIB3","series-title":"3rd Ann. Symp. on Combinatorial Pattern Matching Proc.","first-page":"88","article-title":"New theoretical and computational results for regular languages","volume":"vol. 644","author":"Chang","year":"1992"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB4","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB5","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(97)00131-X_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","article-title":"Regular expression and state graphs for automata","volume":"1","author":"McNaughton","year":"1960","journal-title":"IRA Trans. Electron. Comput. EC-9"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB8","series-title":"First Workshop on Implementing Automata, WIA'96","article-title":"A new quadratic algorithm to convert a regular expression into an automaton","author":"Ponty","year":"1997"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(89)90076-8","article-title":"A note on parallel transformations of regular expressions to nondeterministic finite automata","volume":"31","author":"Rytter","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00131-X_BIB10","series-title":"Algorithms","author":"Sedgewick","year":"1983"},{"issue":"6","key":"10.1016\/S0304-3975(97)00131-X_BIB11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","article-title":"Regular expression search algorithms","volume":"11","author":"Thompson","year":"1968","journal-title":"Common ACM"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB12","series-title":"CIP-DATA Koninklijke Bibliotheek, Den Haag","article-title":"Taxonomies and toolkits of regular language algorithms","author":"Watson","year":"1995"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB13","article-title":"Algorithmique parall\u00e8le et s\u00e9quentielle des automates","author":"Ziadi","year":"1996"},{"key":"10.1016\/S0304-3975(97)00131-X_BIB14","first-page":"177","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:S030439759700131X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700131X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:20:25Z","timestamp":1555420825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700131X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S030439759700131X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00131-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}