{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:52Z","timestamp":1725490552851},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_7","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:49:49Z","timestamp":1188308989000},"page":"94-104","source":"Crossref","is-referenced-by-count":4,"title":["New Finite Automaton Constructions Based on Canonical Derivatives"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[]},{"given":"D.","family":"Ziadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"7_CR1","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V. Antimirov","year":"1996","unstructured":"V. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci., 155:291\u2013319, 1996.","journal-title":"Theoret. Comput. Sci"},{"key":"7_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":"7_CR4","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"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoret. Comput. Sci., 48(1):117\u2013126, 1986.","journal-title":"Theoret. Comput. Sci"},{"issue":"4","key":"7_CR6","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"J.A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Mach., 11(4):481\u2013494, 1964.","journal-title":"J. Assoc. Comput. Mach"},{"doi-asserted-by":"crossref","unstructured":"J.-M. Champarnaud and D. Ziadi, From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. Intern. Journ. of Alg. Comp., to appear.","key":"7_CR7","DOI":"10.1142\/S0218196701000772"},{"key":"7_CR8","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":"7_CR9","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":"7_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BFb0055777","volume-title":"MFCS\u00e998","author":"Ch. Hagenah","year":"1998","unstructured":"Ch. Hagenah and A. Muscholl, Computing \u03b5-free NFA from Regular Expressions in O(nlog2(n)) Time, in: L. Prim et al. (eds.), MFCS\u00e998, Lecture Notes in Computer Science, 1450 (1998), 277\u2013285, Springer."},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0023448","volume-title":"STACS\u201997","author":"J. Hromkovi\u010d","year":"1997","unstructured":"J. Hromkovi\u010d, S. Seibert and T. Wilke, Translating regular expressions into small \u03b5-free nondeterministic finite automata, in: R. Reischuk (ed.), STACS\u201997, Lecture Notes in Computer Science, 1200 (1997), 55\u201366, Springer."},{"key":"7_CR12","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, 1960.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"7_CR13","first-page":"110","volume":"5","author":"B.G. Mirkin","year":"1966","unstructured":"B.G. Mirkin. An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics, 5:110\u2013116, 1966.","journal-title":"Engineering Cybernetics"},{"doi-asserted-by":"crossref","unstructured":"R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.","key":"7_CR14","DOI":"10.1137\/0216062"},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-63174-7_9","volume-title":"A new Quadratic Algorithm to convert a Regular Expression into an Automaton","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 and D. Wood, eds., Lecture Notes in Computer Science, 1260 (1997) 109\u2013119."},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson. Regular expression search algorithm. Comm. ACM, 11(6):419\u2013422, 1968.","journal-title":"Comm. ACM"},{"unstructured":"B.W. Watson. Taxonomies and Toolkit of Regular Languages Algorithms. PhD thesis, Faculty of mathematics and computing science, Eindhoven University of Technology, The Netherlands, 1995.","key":"7_CR17"},{"key":"7_CR18","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, vol. I, 41\u2013110. Springer-Verlag, Berlin, 1997."},{"key":"7_CR19","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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T05:10:19Z","timestamp":1587877819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}