{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:31:03Z","timestamp":1726410663865},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662474006"},{"type":"electronic","value":"9783662474013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47401-3_3","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:04Z","timestamp":1434702424000},"page":"16-24","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating DFA Construction by Parallelizing Subset Construction"],"prefix":"10.1007","author":[{"given":"Yan","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianlong","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"3_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"V Aho","year":"1986","unstructured":"Aho, V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley Publishing Co., Boston (1986)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Maged, M.M., Michael, L.S.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the 15th annual ACM symposium on Principles of distributed computing, pp. 267\u00a0\u2212\u00a0275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Liu, Y., Guo, L., Guo, M., Liu, P.: Accelerating DFA Construction by Hierarchical Merging. In: Proceedings of the 2011 IEEE Ninth International Symposium on Parallel and Distributed Processing with Applications (ISPA), pp. 1\u00a0\u2212\u00a06 (2011)","DOI":"10.1109\/ISPA.2011.32"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Becchi, M., Crowley, P.: An improved algorithm to accelerate regular expression evaluation. In: Proceedings of the 3rd ACM\/IEEE Symposium on Architecture for networking and communications systems, pp. 145\u2013154 (2007)","DOI":"10.1145\/1323548.1323573"},{"key":"3_CR5","volume-title":"Introduction to automata theory, languages, and computation","author":"JE Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. Addison Wesley, Boston (2000)","edition":"2"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1008861.1008870","volume":"12","author":"E Leiss","year":"1980","unstructured":"Leiss, E.: Constructing a finite automaton for a given regular expression. ACM SIGACT News 12(3), 81\u201387 (1980)","journal-title":"ACM SIGACT News"},{"key":"3_CR7","unstructured":"Leslie, T.: Efficient approaches to subset construction. Master thesis, the University of Waterloo, Canada (1995)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-56024-6_8","volume-title":"Combinatorial Pattern Matching","author":"CH Chang","year":"1992","unstructured":"Chang, C.H., Paige, R.: From regular expressions to DFA\u2019s using compressed NFA\u2019s. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) Combinatorial Pattern Matching, vol. 644, pp. 90\u2013110. Springer, Heidelberg (1992)"},{"issue":"4","key":"3_CR9","first-page":"82","volume":"30","author":"S Chen","year":"2008","unstructured":"Chen, S., Su, J.: Protocol identification research based on content analysis. J. Nat. Univ. Def. Technol. 30(4), 82\u201387 (2008)","journal-title":"J. Nat. Univ. Def. Technol."},{"key":"3_CR10","unstructured":"Choi, H., Burgstaller, B.: Non-blocking Parallel Subset construction on shared-memory multicore architectures. In: proceedings of the 11th Australasian symposium on parallel and distributed computing (AusPDC 2013), pp. 13\u00a0\u2212\u00a020 (2013)"}],"container-title":["Communications in Computer and Information Science","Trustworthy Computing and Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47401-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T06:50:29Z","timestamp":1559199029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47401-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662474006","9783662474013"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47401-3_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}