{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:19Z","timestamp":1725664159528},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600442"},{"type":"electronic","value":"9783540494126"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60044-2_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:36:04Z","timestamp":1330277764000},"page":"352-365","source":"Crossref","is-referenced-by-count":2,"title":["Smaller representations for finite-state transducers and finite-state automata"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Roche","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"25_CR1","unstructured":"Alfred Aho, John Hopcroft, and Jeffrey Ulllman. The design and analysis of computer algorithms. Addison Wesley, 1974."},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Jean Berstel. Transductions and Context-Free Languages. Teubner, Stuttgart, 1979."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1970","unstructured":"D. Brelaz. New methods to color vertices of a graph. Comm. ACM, 22:251\u2013256, 1970.","journal-title":"Comm. ACM"},{"key":"25_CR4","volume-title":"Automata, languages, and machines, Volume A","author":"S. Eilenberg","year":"1974","unstructured":"Samuel Eilenberg. Automata, languages, and machines, Volume A. Academic Press, New York, 1974."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C. C. Elgot","year":"1965","unstructured":"C. C. Elgot and G. Mezei. On relations dfined by generalized finite automata. IBM J. of Res. and Dev., 9:47\u201365, 1965.","journal-title":"IBM J. of Res. and Dev."},{"key":"25_CR6","unstructured":"Maurice Gross. M\u00e9thodes en syntaxe,r\u00e9gime des constructions compl\u00e9tives. Hermann, 1975."},{"issue":"3","key":"25_CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D. S. Johnson","year":"1991","unstructured":"David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, and Catherine Schevon. Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitionning. Operations Research, 39(3):378\u2013406, 1991.","journal-title":"Operations Research"},{"key":"25_CR8","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (eds.)\u2019 Complexity of Computer Computations'. Plenum Press, New York, 1972."},{"key":"25_CR9","unstructured":"Eric Laporte. M\u00e9thodes algorithmiques et lexicales de phonetisation de textes. PhD thesis, Universit\u00e9 Paris 7, 1988."},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. T. Leighton","year":"1979","unstructured":"F. T. Leighton. A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Standards, 84:489\u2013506, 1979.","journal-title":"J. Res. Natl. Bur. Standards"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Mehryar Mohri. Minimisation of sequential transducers. In Proceedings of the Conference on Computational Pattern Matching 1994, 1994.","DOI":"10.1007\/3-540-58094-8_14"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0220042","volume":"20","author":"C. Reutenauer","year":"1991","unstructured":"Christophe Reutenauer and Marcel-Paul Schutzenberger. Minnimization of rational word functions. SIAM J. Comput., 20:669\u2013685, 1991.","journal-title":"SIAM J. Comput."},{"key":"25_CR13","unstructured":"Emmanuel Roche. Analyse Syntaxique Transformationelle du Fran\u00c7ais par Transducteurs et Lexique-Grammaire. PhD thesis, Universit\u00e9 Paris 7, January 1993."},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"M. P. Schutzenberger","year":"1961","unstructured":"Marcel Paul Schutzenberger. A remark on finite transducers. Information and Control, 4:185\u2013187, 1961.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60044-2_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:28:46Z","timestamp":1605648526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60044-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600442","9783540494126"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60044-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}