{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:49:27Z","timestamp":1768686567015,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243182","type":"print"},{"value":"9783540305002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_9","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"90-101","source":"Crossref","is-referenced-by-count":6,"title":["Computing the Follow Automaton of an Expression"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Nicart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V. Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci.\u00a0155, 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","first-page":"197","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular Expressions into Finite Automata, Theoret. Comput. Sci.\u00a0120, 197\u2013213 (1993)","journal-title":"Comput. Sci."},{"key":"9_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. Comput. Sci.\u00a0267, 17\u201334 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-48194-X_15","volume-title":"Combinatorial Pattern Matching","author":"J.-M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.-M., Ziadi, D.: Computing the Equation Automaton of a Regular Expression in O(s2) Space and Time. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 157\u2013168. Springer, Heidelberg (2001)"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1142\/S0218196701000772","volume":"11","author":"J.-M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.-M., Ziadi, D.: From c-continuations to new quadratic algorithms for automaton synthesis. Intern. Journ. of Alg. and Comp.\u00a011(6), 707\u2013735 (2001)","journal-title":"Intern. Journ. of Alg. and Comp."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0129054102000972","volume":"13","author":"J.-M. Champarnaud","year":"2002","unstructured":"Champarnaud, J.-M.: Evaluation of three implicit structures to implement nondeterministic automata from regular expressions. Intern. J. of Foundations of Comp. Sc.\u00a013(1), 99\u2013113 (2002)","journal-title":"Intern. J. of Foundations of Comp. Sc."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00140-5","volume":"178","author":"C.-H. Chang","year":"1997","unstructured":"Chang, C.-H., Paige, R.: From Regular Expressions to DFA\u2019s Using Compressed NFA\u2019s. Theoret. Comput. Sci.\u00a0178, 1\u201336 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR8","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 Math. Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Math. Surveys"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita:2000116","volume":"34","author":"C. Hagenah","year":"2000","unstructured":"Hagenah, C., Muscholl, A.: Computing \u03b5-free NFAs from regular expressions in O(n log2(n)) time. Theoret. Inform. Appl.\u00a034(4), 257\u2013277 (2000)","journal-title":"Theoret. Inform. Appl."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J. Hromkovic","year":"2001","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small \u03b5-free nondeterministic finite automata. J. Comput. System Sci.\u00a062(4), 565\u2013588 (2001)","journal-title":"J. Comput. System Sci."},{"key":"9_CR11","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45452-7_23","volume-title":"Combinatorial Pattern Matching","author":"L. Ilie","year":"2002","unstructured":"Ilie, L., Yu, S.: Constructing NFAs by optimal use of positions in regular expressions. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 279\u2013288. Springer, Heidelberg (2002)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45687-2_27","volume-title":"Mathematical Foundations of Computer Science 2002","author":"L. Ilie","year":"2002","unstructured":"Ilie, L., Yu, S.: Algorithms for Computing Small NFAs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 328\u2013340. Springer, Heidelberg (2002)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular Expressions and State Graphs For Automata. IEEE Trans. on Electronic Computers\u00a09(1), 39\u201347 (1960)","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-63174-7_9","volume-title":"Automata Implementation","author":"J.-L. Ponty","year":"1997","unstructured":"Ponty, J.-L., Ziadi, D., Champarnaud, J.-M.: A new Quadratic Algorithm to Convert a Regular Expression into an Automaton. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 109\u2013110. Springer, Heidelberg (1997)"},{"key":"9_CR16","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":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer, Berlin (1997)"},{"key":"#cr-split#-9_CR17.1","unstructured":"Ziadi, D., Ponty, J.-L., Champarnaud, J.-M.: Passage d???une expression rationnelle ?? un automate fini non-d??terministe. Journ??es Montoises (1995);"},{"key":"#cr-split#-9_CR17.2","doi-asserted-by":"crossref","unstructured":"Bull. Belg. Math. Soc. 4, 177???203 (1997)","DOI":"10.36045\/bbms\/1105730628"}],"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_9.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_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}