{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:55:11Z","timestamp":1776858911289,"version":"3.51.2"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319214993","type":"print"},{"value":"9783319215006","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_28","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"352-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Surminimisation of Automata"],"prefix":"10.1007","author":[{"given":"Victor","family":"Marsault","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00224-005-1215-5","volume":"40","author":"V Berth\u00e9","year":"2007","unstructured":"Berth\u00e9, V., Rigo, M.: Odometers on regular languages. Theory Comput. Syst. 40(1), 1\u201331 (2007)","journal-title":"Theory Comput. Syst."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164\u2013192 (1972)","journal-title":"Math. Systems Theory"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0022-314X(91)90054-F","volume":"39","author":"J-M Dumont","year":"1991","unstructured":"Dumont, J.-M., Thomas, A.: Digital sum problems and substitutions on a finite alphabet. Journal of Number Theory 39(3), 351\u2013366 (1991)","journal-title":"Journal of Number Theory"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1051\/ita\/2011114","volume":"46","author":"C Frougny","year":"2012","unstructured":"Frougny, C., Klouda, K.: Rational base number systems for p-adic numbers. RAIRO - Theor. Inf. and Applic. 46(1), 87\u2013106 (2012)","journal-title":"RAIRO - Theor. Inf. and Applic."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Frougny, C., Sakarovitch, J.: Number representation and finite automata. In: Berth\u00e9, V., Rigo, M. (eds) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications 135, pp. 34\u2013107. Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511777653.003"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34, 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"key":"28_CR7","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Lecomte, P., Rigo, M.: Abstract numeration systems. In: Berth\u00e9, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications 135, pp. 108\u2013162. Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511777653.004"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s002240010014","volume":"34","author":"P Lecomte","year":"2001","unstructured":"Lecomte, P., Rigo, M.: Numeration systems on a regular language. Theory Comput. Syst. 34, 27\u201344 (2001)","journal-title":"Theory Comput. Syst."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"issue":"3","key":"28_CR11","first-page":"351","volume":"7","author":"M Rigo","year":"2002","unstructured":"Rigo, M., Maes, A.: More on generalized automatic sequences. Journal of Automata, Languages and Combinatorics 7(3), 351\u2013376 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"28_CR12","unstructured":"Sakarovitch, J.: El\u00e9ments de th\u00e9orie des automates. Vuibert, 2003. Corrected English translation: Elements of Automata Theory. Cambridge University Press (2009)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:12:42Z","timestamp":1676466762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}