{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:54Z","timestamp":1725490554385},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_6","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:49:49Z","timestamp":1188308989000},"page":"80-93","source":"Crossref","is-referenced-by-count":1,"title":["Implicit Structures to Implement NFA\u2019s from Regular Expressions"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"6_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"A. Br\u00fcggemann-Klein, Regular Expressions into Finite Automata. Theoret. Comput. Sci., 120 (1993), 197\u2013213.","journal-title":"Theoret. Comput. Sci"},{"key":"6_CR3","volume-title":"\u00c9l\u00e9ments d\u2019Algorithmique","author":"D. Beauquier","year":"1992","unstructured":"D. Beauquier, J. Berstel, and P. Chr\u00e9tienne. \u00c9l\u00e9ments d\u2019Algorithmique. Masson, Paris, 1992."},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-48057-9_5","volume-title":"WIA\u201998","author":"J.-M. Champarnaud","year":"1999","unstructured":"J.-M. Champarnaud, D. Ziadi and J.-L. Ponty, Determinization of Glushkov automata. In J.-M. Champarnaud et al., eds, WIA\u201998, Lecture Notes in Computer Science, 1660 (1999), 57\u201368, Springer."},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","first-page":"88","volume-title":"From Regular Expressions to DFAs using Compressed NFAs","author":"C.-H. Chang","year":"1992","unstructured":"C.-H. Chang and R. Paige. From Regular Expressions to DFAs using Compressed NFAs, in Apostolico. Crochemore. Galil. and Manber. editors. Lecture Notes in Computer Science, 644(1992), 88\u2013108."},{"key":"6_CR6","unstructured":"G. Giammarresi, J.-L. Ponty and D. Wood, The Glushkov and Thompson Machines Reexamined. Submitted."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"V.M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1\u201353, 1961.","journal-title":"Russian Mathematical Surveys"},{"key":"6_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0023448","volume-title":"STACS 97","author":"J. Hromkovi\u010b","year":"1997","unstructured":"J. Hromkovi\u010b, S. Seibert, and T. Wilke. Translating regular expressions into small \u03b5-free nondeterministic finite automata. In R. Reischuk and M. Morvan, eds, STACS 97, Lecture Notes in Computer Science, 1200(1997), 55\u201366, Springer."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R.F. McNaughton","year":"1960","unstructured":"R.F. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39\u201357, March 1960.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-63174-7_9","volume-title":"WIA\u201996","author":"J.-L. Ponty","year":"1997","unstructured":"J.-L. Ponty, D. Ziadi, and J.-M. Champarnaud. A new quadratic algorithm to convert a regular expression into an automaton. In D. Raymond et al., eds, WIA\u201996, Lecture Notes in Computer Science, 1260(1997), 109\u2013119, Springer."},{"key":"6_CR11","unstructured":"J.-L. Ponty. Algorithmique et impl\u00e9mentation des automates. Th\u00e8se, Rouen, France, 1997."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"J.-L. Ponty. An efficient null-free procedure for deciding regular language membership. Theoret. Comput. Sci., WIA\u201997 Special Issue, D. Wood and S. Yu, editors, 231(2000).","DOI":"10.1016\/S0304-3975(99)00019-5"},{"key":"6_CR13","first-page":"419","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson, Regular Expression Search Algorithm, Comm. Assoc. Comput. Mach. 11(1968) 419\u2013422.","journal-title":"Comm. Assoc. Comput. Mach"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, Word, Language, Grammar, pages 41\u2013110. Springer, Berlin, 1997."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.36045\/bbms\/1105730628","volume":"4","author":"D. Ziadi","year":"1995","unstructured":"D. Ziadi, J.-L. Ponty and J.-M. Champarnaud. Passage d\u2019une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe, Journ\u00e9es Montoises (1995), Bull. Belg. Math. Soc., 4:177\u2013203, 1997.","journal-title":"Bull. Belg. Math. Soc"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T05:10:22Z","timestamp":1587877822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}