{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:28:46Z","timestamp":1737437326712,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_16","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"145-156","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Computation of the Equation $\\mathbb{K}$ -Automaton of a Regular $\\mathbb{K}$ -Expression"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faissal","family":"Ouardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djelloul","family":"Ziadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11821069_10","volume-title":"Mathematical Foundations of Computer Science 2006","author":"C. Allauzen","year":"2006","unstructured":"Allauzen, C., Mohri, M.: A Unified Construction of the Glushkov, Follow, and Antimirov Automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 110\u2013121. Springer, Heidelberg (2006)"},{"key":"16_CR2","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":"16_CR3","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":"Br\u00fcggemann-Klein, A.: Regular Expressions into Finite Automata. Theoret. Comput. Sci.\u00a0120, 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR4","volume-title":"\u00c9tudes et recherches en informatique","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Les s\u00e9ries rationnelles et leurs langages. In: \u00c9tudes et recherches en informatique, Masson, Paris, 1984, Springer, Berlin Heidelberg English version: Rational series and their languages (1988)"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1080\/0020716021000038992","volume":"80","author":"P. Caron","year":"2003","unstructured":"Caron, P., Flouret, M.: Glushkov construction for series: The non commutative case. Intern. Journ. Comput. Maths\u00a080(4), 457\u2013472 (2003)","journal-title":"Intern. Journ. Comput. Maths"},{"issue":"15","key":"16_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1142\/S0129054104002698","volume":"5","author":"J.-M. Champarnaud","year":"2004","unstructured":"Champarnaud, J.-M., Laugerotte, E., Ouardi, F., Ziadi, D.: From Regular Weighted Expressions to Finite Automata. Intern. Journ. of Found. Comput. Sci.\u00a05(15), 687\u2013700 (2004)","journal-title":"Intern. Journ. of Found. Comput. Sci."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1142\/S0218196706002895","volume":"16","author":"J.-M. Champarnaud","year":"2006","unstructured":"Champarnaud, J.-M., Nicart, F., Ziadi, D.: From the ZPC-structure of a regular expression to its follow automaton. Intern. Journ. of Alg. and Comp.\u00a016(1), 17\u201334 (2006)","journal-title":"Intern. Journ. of Alg. and Comp."},{"key":"16_CR8","unstructured":"Champarnaud, J.-M., Ouardi, F., Ziadi, D.: Follow automaton versus equation automaton. In: Ilie, L., Wotschke, D. (eds.) DCFS 2004, Descriptional Complexity of Formal Systems Workshop, Proceedings, pp. 145\u2013153 (2004)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Champarnaud, J.-M., Ouardi, F., Ziadi, D.: Normalized expressions and finite automata, Intern. Journ. of Alg. and Comp. (to appear)","DOI":"10.1142\/S021819670700355X"},{"issue":"3","key":"16_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"J.-M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.-M., Ziadi, D.: From Mirkin\u2019s Prebases to Antimirov\u2019s Word Partial Derivatives. Informatica Fundamentae\u00a045(3), 195\u2013205 (2001)","journal-title":"Informatica Fundamentae"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"J.-M. Champarnaud","year":"2002","unstructured":"Champarnaud, J.-M., Ziadi, D.: Canonical derivatives and finite automaton constructions. Theoret. Compt. Sci.\u00a0289, 137\u2013163 (2002)","journal-title":"Theoret. Compt. Sci."},{"issue":"6","key":"16_CR12","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."},{"key":"16_CR13","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":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11605157_10","volume-title":"Implementation and Application of Automata","author":"T. Claveirole","year":"2006","unstructured":"Claveirole, T., Lombardy, S., O\u2019Connor, S., Pouchet, L.-N., Sakarovitch, J.: Inside Vaucanson. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 116\u2013128. Springer, Heidelberg (2006)"},{"key":"16_CR15","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":"16_CR16","volume-title":"Semirings: algebraic theory and applications in computer science","author":"U. Hebisch","year":"1993","unstructured":"Hebisch, U., Weinert, H.J.: Semirings: algebraic theory and applications in computer science. World Scientific, Singapore (1993)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Information and computation\u00a0186, 140\u2013162 (2003)","journal-title":"Information and computation"},{"key":"16_CR18","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata, languages. In: EATCS Monographs on Theoretical Computer Science, vol.\u00a05, Springer-Verlag, Berlin Heidelberg (1986) Princeton U. Press"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45687-2_39","volume-title":"Mathematical Foundations of Computer Science 2002","author":"S. Lombardy","year":"2002","unstructured":"Lombardy, S., Sakarovitch, J.: Derivations of Rational Expressions with Multiplicity. In: Diks, K., Ritter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 471\u2013482. Springer, Heidelberg (2002)"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.10.016","volume":"332","author":"S. Lombardy","year":"2005","unstructured":"Lombardy, S., Sakarovitch, J.: Derivatives of Rational Expressions with Multiplicity. Theoret. Comput. Sci.\u00a0332, 141\u2013177 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R.F. McNaughton","year":"1960","unstructured":"McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electronic Comput.\u00a09, 39\u201347 (1960)","journal-title":"IEEE Trans. Electronic Comput."},{"key":"16_CR22","first-page":"110","volume":"5","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics\u00a05, 110\u2013116 (1966)","journal-title":"Engineering Cybernetics"},{"key":"16_CR23","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de la th\u00e9orie des automates. Les classiques de l\u2019informatique, Vuibert Paris (2003)"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"6","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and control\u00a06, 245\u2013270 (1961)","journal-title":"Information and control"},{"issue":"6","key":"16_CR25","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Comm. ACM\u00a011(6), 419\u2013422 (1968)","journal-title":"Comm. ACM"},{"key":"16_CR26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.36045\/bbms\/1105730628","volume":"4","author":"D. Ziadi","year":"1997","unstructured":"Ziadi, D., Ponty, J.-L., Champarnaud, J.-M.: Passage d\u2019une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe. Bull. Belg. Math. Soc.\u00a04, 177\u2013203 (1997)","journal-title":"Bull. Belg. Math. Soc."},{"key":"16_CR27","unstructured":"Ziadi, D.: Quelques aspects th\u00e9oriques et algorithmiques des automates. Th\u00e8se d\u2019habilitation \u00e0 diriger des recherches, Universit\u00e9 de Rouen (2002)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T23:29:38Z","timestamp":1737415778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}