{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:37:29Z","timestamp":1773081449640,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405610","type":"print"},{"value":"9783540450894","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_10","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Introducing Vaucanson"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Lombardy","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl","family":"Poss","sequence":"additional","affiliation":[]},{"given":"Yann","family":"R\u00e9gis-Gianas","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"10_CR1","first-page":"166","volume":"47","author":"A. Arnold","year":"1992","unstructured":"A. Arnold, A. Dicky, and M. Nivat, A note about minimal non-deterministic automata, Bull. EATCS 47 (1992), 166\u2013169.","journal-title":"Bull. EATCS"},{"issue":"1","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":"J.-M. Champarnaud and D. Ziadi, Canonical derivatives, partial derivatives and finite automaton constructions, Theor. Comp. Sci. 289 (2002), no. 1, 137\u2013163.","journal-title":"Theor. Comp. Sci."},{"key":"10_CR3","unstructured":"J.H. Conway, Regular algebra and finite machines, Chapman and Hall, 1971."},{"key":"10_CR4","unstructured":"J. Darbon, T. G\u00e9raud, and A. Duret-Lutz, Generic implementation of morphological image operators, Int. Symp. on Mathematical Morphology VI (ISMM\u20192002), April 2002, pp. 175\u2013184."},{"key":"10_CR5","unstructured":"A. Duret-Lutz, T. G\u00e9raud, and A. Demaille, Design patterns for generic programming in C++, Proc. of the 6th USENIX Conf. on Object-Oriented Technologies and Systems (COOTS\u201901), USENIX Association, 2001, pp. 189\u2013202."},{"key":"10_CR6","unstructured":"A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Sch\u00f6nherr, On the design of CGAL, the computational geometry algorithms library, Tech. Report 3407, INRIA, April 1998."},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-47910-4_21","volume-title":"Design patterns: Abstraction and reuse of object-oriented design","author":"E. Gamma","year":"1993","unstructured":"E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design patterns: Abstraction and reuse of object-oriented design, LNCS 707 (1993), 406\u2013431."},{"key":"10_CR8","unstructured":"J. Hopcroft and J. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley, 1979."},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-45465-9_16","volume-title":"Proc. of ICALP\u201902","author":"S. Lombardy","year":"2002","unstructured":"S. Lombardy, On the construction of reversible automata for reversible languages, Proc. of ICALP\u201902, LNCS 2380 (2002), 170\u2013182."},{"key":"10_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-45995-2_12","volume-title":"Proc. of LATIN\u201902","author":"S. Lombardy","year":"2002","unstructured":"S. Lombardy and J. Sakarovitch, Star height of reversible languages and universal automata, Proc. of LATIN\u201902, LNCS 2286 (2002), 76\u201389."},{"key":"10_CR11","unstructured":"S. Lombardy and J. Sakarovitch, Vaucanson-G, A package for drawing automata and graphs, \n                    http:\/\/www.liafa.jussieu.fr\/~lombardy\/Vaucanson-G\/\n                    \n                  , 2002."},{"key":"10_CR12","unstructured":"S. Lombardy and J. Sakarovitch, On the star height of rational languages, a new presentation for two old results, World Scientific (to appear)."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-44674-5_16","volume-title":"Proc. of CIAA 2000","author":"V. Maout Le","year":"2001","unstructured":"V. Le Maout, Cursors, Proc. of CIAA 2000, LNCS 2088 (2001), 195\u2013207."},{"key":"10_CR14","unstructured":"O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, The Program AMoRE, \n                    http:\/\/www-i7.informatik.rwth-aachen.de\/d\/research\/amore.html\n                    \n                  , RWTH Aachen, 1995."},{"key":"10_CR15","unstructured":"O. Matz and A. Potthoff, Computing small nondeterministic finite automata, proc. of TACAS\u201995, BRICS Notes Series, 1995, pp. 74\u201388."},{"key":"10_CR16","unstructured":"M. Mohri, F. C.N. Pereira, and M. Riley, General-purpose Finite-State Machine Software Tools, \n                    http:\/\/www.research.att.com\/sw\/tools\/fsm\/\n                    \n                  , AT&T Labs \u2014 Research, 1997."},{"issue":"7","key":"10_CR17","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/spe.4380240703","volume":"24","author":"D.R. Musser","year":"1994","unstructured":"D.R. Musser and A.A. Stepanov, Algorithm-oriented generic libraries, Software-Practice and Experience 24 (1994), no. 7, 623\u2013642.","journal-title":"Software-Practice and Experience"},{"key":"10_CR18","unstructured":"G. van Noord, Finite State Automata Utilities, \n                    http:\/\/odur.let.rug.nl\/~vannoord\/Fsa\/\n                    \n                  , 2000."},{"key":"10_CR19","unstructured":"J. Sakarovitch, \u00c9l\u00e9ments de th\u00e9orie des automates, Vuibert, 2003."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45089-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:40:27Z","timestamp":1558262427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"24 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}