{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:11Z","timestamp":1725549191853},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_8","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"80-89","source":"Crossref","is-referenced-by-count":0,"title":["Brute Force Determinization of NFAs by Means of State Covers"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Coulon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Parantho\u00ebn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1093\/nar\/28.1.45","volume":"28","author":"A. Bairoch","year":"2000","unstructured":"Bairoch, A., Apweiler, R.: The SWISS-PROT protein sequence database and its supplement TrEMBL in 2000. Nucleic Acids Research\u00a028(1), 45\u201348 (2000)","journal-title":"Nucleic Acids Research"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. Campeanu","year":"2002","unstructured":"Campeanu, C., Paun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. Journal of Foundations of ComputerScience\u00a013(1), 83\u201397 (2002)","journal-title":"Int. Journal of Foundations of ComputerScience"},{"issue":"1-2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00293-0","volume":"267","author":"J.-M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.-M.: Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theoret. Comp. Sc.\u00a0267(1-2), 17\u201334 (2001)","journal-title":"Theoret. Comp. Sc."},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00207160310001650025","volume":"81","author":"J.-M. Champarnaud","year":"2004","unstructured":"Champarnaud, J.-M., Coulon, F., Parantho\u00ebn, T.: Compact and fast algorithms for safe regular expression search. Intern. J. of Computer. Math.\u00a081(4), 383\u2013401 (2004)","journal-title":"Intern. J. of Computer. Math."},{"key":"8_CR5","unstructured":"Champarnaud, J.-M., Hansel, G., Parantho\u00ebn, T., Ziadi, D.: Nfas random generation models. In: Proceedings of DCFS (2002)"},{"key":"8_CR6","unstructured":"Coulon, F.: CCP software, \n                    \n                      http:\/\/www.univ-rouen.fr\/LIFAR\/aia\/ccp.html"},{"key":"8_CR7","volume-title":"Mastering Regular Expressions","author":"J.E.F. Friedl","year":"2002","unstructured":"Friedl, J.E.F.: Mastering Regular Expressions, 2nd edn. O\u2019Reilly, Sebastopol (2002)","edition":"2"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","first-page":"75","volume-title":"Automata Implementation","author":"J. Glenn","year":"1997","unstructured":"Glenn, J., Gasarch, W.I.: Implementing WS1S via finite automata: Performance issues. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 75\u201386. Springer, Heidelberg (1997)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.-M. Glushkov","year":"1961","unstructured":"Glushkov, V.-M.: The abstract theory of automata. Russian Mathematical Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-63174-7_6","volume-title":"Automata Implementation","author":"J.H. Johnson","year":"1997","unstructured":"Johnson, J.H., Wood, D.: Instruction computation in subset construction. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 64\u201371. Springer, Heidelberg (1997)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44688-5_1","volume-title":"Algorithm Engineering","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Raffinot, M.: Compact DFA representation for fast regular expression search. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 1\u201312. Springer, Heidelberg (2001)"},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings \u2013 Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002) ISBN 0-521-81307-7"},{"issue":"10","key":"8_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching algorithm allowing errors. CACM\u00a035(10), 83\u201391 (1992)","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:23Z","timestamp":1605761843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}