{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:45Z","timestamp":1725488265679},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428121"},{"type":"electronic","value":"9783540455264"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45526-4_2","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T01:12:00Z","timestamp":1185844320000},"page":"13-26","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SEA: A Symbolic Environment for Automata Theory"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Andary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Caron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Duchamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marianne","family":"Flouret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Laugerotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"key":"2_CR1","unstructured":"J. Berstel and D. Perrin, Theory of codes, Academic Press, 1985."},{"key":"2_CR2","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"B. J","year":"1988","unstructured":"J. Berstel and C. Reutenauer, Rational series and their languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988."},{"issue":"8","key":"2_CR3","first-page":"863","volume":"27","author":"C. P","year":"1997","unstructured":"P. Caron, AG: A set of Maple packages for manipulating automata and finite semigroups. Software-Practice & Experience, 27(8), 863\u2013884, 1997.","journal-title":"AG: A set of Maple packages for manipulating automata and finite semigroups"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","volume":"12","author":"J.-M Champarnaud","year":"1991","unstructured":"J.-M. Champarnaud and G. Hansel, Automate, a computing package for automata and finite semigroups, J. Symbolic Comput., 12, 197\u2013220, 1991.","journal-title":"J. Symbolic Comput."},{"key":"2_CR5","unstructured":"G. Duchamp, M. Flouret and E. Laugerotte, Operations over automata with multiplicities, WIA 98, to appear in Lect. Notes in Comp. Sci."},{"key":"2_CR6","unstructured":"S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, 1974."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0020-0190(97)00162-2","volume":"64","author":"F. M","year":"1997","unstructured":"M. Flouret and E. Laugerotte, Noncommutative minimization algorithms, Inform. Process. Lett., 64, 123\u2013126, 1997.","journal-title":"Inform. Process. Lett."},{"key":"2_CR8","unstructured":"M. Flouret, Contribution \u00e0 l\u00e1lgorithmique non commutative, Ph.D. thesis, University of Rouen, 1999."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The theory of machines and computations","author":"J. E. Hopcroft","year":"1971","unstructured":"J. E. Hopcroft, An n log n algorithm for minimizing the states in a finite automaton, In Z. Kohavi, editor, The theory of machines and computations, pages 189\u2013196. Academic Press, New York, 1971."},{"key":"2_CR10","unstructured":"J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"S. C. Kleene, Representation of events in nerve nets and finite automata, Automata studies, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"2_CR12","unstructured":"M. Lothaire, Combinatorics on words, Addison-Wesley, 1983."},{"key":"2_CR13","unstructured":"O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkena, Report on the program AMoRE, Report, Institut fur informatik und praktische mathematik, Christian-Albrechts Universitat, Kiel, 1995."},{"key":"2_CR14","first-page":"129","volume-title":"Automata studies","author":"E. F. Moore","year":"1956","unstructured":"E. F. Moore, Gedanken experiments on sequential machines, In Automata studies, pages 129\u2013153, Princeton Univ. Press, Princeton, N.J., 1956."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"A. Nerode, Linear automata transformation In Proceedings of AMS 9, pages 541\u2013544, 1958.","DOI":"10.2307\/2033204"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"R. D","year":"1994","unstructured":"D. Raymond and D. Wood, Grail, a C++ library for automata and expressions, J. Symbolic Comput., 17, 341\u2013350, 1994.","journal-title":"J. Symbolic Comput."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. P Schutzenberger","year":"1961","unstructured":"M. P. Schutzenberger, On the definition of a family of automata, Inform. and Control, 4,245\u2013270, 1961.","journal-title":"Inform. and Control"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"885","DOI":"10.2307\/2034080","volume":"13","author":"M. P Schutzenberger","year":"1962","unstructured":"M. P. Schutzenberger, On a theorem of R. Jungen, Proc. Amer. Soc., 13, 885\u2013890, 1962.","journal-title":"Proc. Amer. Soc."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45526-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:21:15Z","timestamp":1558470075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45526-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428121","9783540455264"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45526-4_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"16 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}