{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:50:03Z","timestamp":1742939403464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_27","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"353-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Preset Distinguishing Sequences and Diameter of Transformation Semigroups"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Panteleev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: On the diameter of eulerian orientations of graphs. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete algorithms, pp. 822\u2013831. ACM, New York (2006)","DOI":"10.1145\/1109557.1109648"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Cohn, M.: Properties of linear machines. J. ACM 11(3), 296\u2013301 (1964), http:\/\/doi.acm.org\/10.1145\/321229.321233","DOI":"10.1145\/321229.321233"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Gazdag, Z., Iv\u00e1n, S., Nagy-Gy\u00f6rgy, J.: Improved upper bounds on synchronizing nondeterministic automata. Information Processing Letters 109(17), 986\u2013990 (2009), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019009001811","DOI":"10.1016\/j.ipl.2009.05.007"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Gill, A.: State-identification experiments in finite automata. Inform. Control 4(2-3), 132\u2013154 (1961), http:\/\/www.sciencedirect.com\/science\/article\/pii\/S001999586180003X","DOI":"10.1016\/S0019-9958(61)80003-X"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"G\u00fcni\u00e7en, C., \u0130nan, K., T\u00fcrker, U.C., Yenig\u00fcn, H.: The relation between preset distinguishing sequences and synchronizing sequences. Formal Aspects of Computing, 1\u201315 (2014), http:\/\/dx.doi.org\/10.1007\/s00165-014-0297-8","DOI":"10.1007\/s00165-014-0297-8"},{"issue":"4","key":"27_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/321088.321098","volume":"8","author":"TN Hibbard","year":"1961","unstructured":"Hibbard, T.N.: Least upper bounds on minimal terminal state experiments for two classes of sequential machines. J. ACM 8(4), 601\u2013612 (1961)","journal-title":"J. ACM"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Karacuba, A.A.: Solution to a problem in the theory of finite automatons. Uspehi Mat. Nauk 15(3) (93), 157\u2013159 (1960)","DOI":"10.1002\/j.1477-8696.1960.tb00647.x"},{"key":"27_CR8","unstructured":"Kohavi, Z.: Switching and finite automata theory. McGraw-Hill (1970)"},{"key":"27_CR9","first-page":"92","volume":"5","author":"E Landau","year":"1903","unstructured":"Landau, E.: \u00dcber die maximalordnung der permutationen gegebenes grades. Archiv der Math. und Phys. 5, 92\u2013103 (1903)","journal-title":"Archiv der Math. und Phys."},{"issue":"8","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines \u2013 a survey. Proceedings of the IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Martyugin, P.: A lower bound for the length of the shortest carefully synchronizing words. Russian Mathematics 54(1), 46\u201354 (2010), http:\/\/dx.doi.org\/10.3103\/S1066369X10010056","DOI":"10.3103\/S1066369X10010056"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken experiments on sequential machines. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 129\u2013153. Princeton U. (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"27_CR13","unstructured":"Panteleev, P.A.: On the distinguishability of states of an automaton under distortions at the input. Intellekt. Sist. 11(1\u20134), 653\u2013678 (2007) (in Russian)"},{"key":"27_CR14","first-page":"194","volume":"16","author":"IK Rystsov","year":"1980","unstructured":"Rystsov, I.K.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybernetics and Systems Analysis 16, 194\u2013198 (1980)","journal-title":"Cybernetics and Systems Analysis"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Rystsov, I.K.: Diagnostic words for automata having a finite memory. Cybernetics 9(6), 927\u2013928 (1973). http:\/\/dx.doi.org\/10.1007\/BF01071671","DOI":"10.1007\/BF01071671"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(01)00227-4","volume":"292","author":"A Salomaa","year":"2003","unstructured":"Salomaa, A.: Composition sequences for functions over a finite domain. Theoret. Comput. Sci. 292, 263\u2013281 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR17","first-page":"988","volume":"7","author":"MN Sokolovskii","year":"1971","unstructured":"Sokolovskii, M.N.: Diagnostic experiments with automata. Cybernetics and Systems Analysis 7, 988\u2013994 (1971)","journal-title":"Cybernetics and Systems Analysis"},{"key":"27_CR18","unstructured":"Sokolovskii, M.N.: The complexity of the generation of transformations, and experiments with automata. In: Discrete analysis methods in the theory of codes and schemes, vol. 29, pp. 68\u201386. Institute of Mathematics, Siberian. Branch USSR Acad. Sci. (1976) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:06:42Z","timestamp":1674904002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}