{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:09Z","timestamp":1725545049614},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_10","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T10:07:40Z","timestamp":1141207660000},"page":"116-128","source":"Crossref","is-referenced-by-count":5,"title":["Inside Vaucanson"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Claveirole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Lombardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"O\u2019Connor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2004.07.007","volume":"328","author":"S. Lombardy","year":"2004","unstructured":"Lombardy, S., R\u00e9gis-Gianas, Y., Sakarovitch, J.: Introducing vaucanson. Theoretical Computer Science\u00a0328, 77\u201396 (2004)","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","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, partial derivatives and finite automaton constructions. Theor. Comput. Sci.\u00a0289, 137\u2013163 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR3","first-page":"50","volume":"1","author":"W. Kuich","year":"1966","unstructured":"Kuich, W., Walk, K.: Block-stochastic matrices and associated finite-state languages. Computing (Arch. Elektron. Rechnen)\u00a01, 50\u201361 (1966)","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"unstructured":"Sakarovitch, J.: El\u00e9ments de th\u00e9orie des automates. Vuibert, Translation: Elements of Automata Theory, Cambridge Universiy Press (to appear, 2003)","key":"10_CR4"},{"key":"10_CR5","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. Theoretical Computer Science\u00a0332, 141\u2013177 (2005)","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971)","author":"J. Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of machines and computations (Proc. Internat. Sympos., Technion, Haifa, 1971), pp. 189\u2013196. Academic Press, New York (1971)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-30500-2_4","volume-title":"Implementation and Application of Automata","author":"J. Berstel","year":"2005","unstructured":"Berstel, J., Carton, O.: On the complexity of hopcroft\u2019s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 35\u201344. Springer, Heidelberg (2005)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V.M. Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci.\u00a0155, 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop\u00a09, 47\u201368 (1965)","journal-title":"IBM J. Res. Develop"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"10_CR11","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0A. Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], New York (1974); Pure and Applied Mathematics, vol. 58"},{"key":"10_CR12","series-title":"Leitf\u00e4den der Angewandten Mathematik und Mechanik [Guides to Applied Mathematics and Mechanics]","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free languages. Leitf\u00e4den der Angewandten Mathematik und Mechanik [Guides to Applied Mathematics and Mechanics], vol.\u00a038. B. G. Teubner, Stuttgart (1979)"},{"key":"10_CR13","volume-title":"Proc. Finite State Devices for Natural Language","author":"F. Pereira","year":"1997","unstructured":"Pereira, F., Riley, M.: Speech Recognition by Composition of Weighted Finite Automata. In: Proc. Finite State Devices for Natural Language, MIT Press, Cambridge (1997)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M. Mohri","year":"2000","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theor. Comput. Sci.\u00a0231, 17\u201332 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR15","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic combinatorics on words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"unstructured":"Burrus, N., Duret-Lutz, A., G\u00e9raud, T., Lesage, D., Poss, R.: A static c++ object-oriented programming (scoop) paradigm mixing benefits of traditional oop and generic programming. In: Proc. of MPOOL 2003, 18th SIGPLAN Conf. (2003)","key":"10_CR16"},{"unstructured":"R\u00e9gis-Gianas, Y., Poss, R.: On orthogonal specialization in c++: Dealing with efficiency and algebraic abstraction in vaucanson. In: Proc. of POOSC 2003 (2003)","key":"10_CR17"},{"unstructured":"Xerces: \n                    \n                      http:\/\/xml.apache.org\/xerces-c\/","key":"10_CR18"},{"key":"10_CR19","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software","author":"E. Gamma","year":"1995","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading (1995)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:12Z","timestamp":1619492712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11605157_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}