{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:33:25Z","timestamp":1743064405073,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223599"},{"type":"electronic","value":"9783319223605"}],"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-22360-5_16","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T08:24:42Z","timestamp":1437985482000},"page":"188-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Kushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 363\u2013372 (1995)","DOI":"10.1145\/225058.225161"},{"key":"16_CR2","first-page":"208","volume":"14","author":"H Cern\u2019y","year":"1964","unstructured":"Cern\u2019y, H.: Pozn\u2019amka k homog\u2019ennym eksperimentom s konecn\u2019ymi avtomatami. Mat. Fyz. Cas. Slovensk. Akad. Vied. 14, 208\u2013216 (1964). (in Slovak)","journal-title":"Mat. Fyz. Cas. Slovensk. Akad. Vied."},{"issue":"6","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/s00165-014-0297-8","volume":"26","author":"C G\u00fcni\u00e7en","year":"2014","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 Comput. 26(6), 1153\u20131167 (2014)","journal-title":"Formal Aspects Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Hierons, R.M., Jourdan, G.V., Ural, H., Yenigun, H.: Using adaptive distinguishing sequences in checking sequence constructions. In: Proceedings of the 2008 ACM Symposium on Applied Computing, pp. 682\u2013687 (2008)","DOI":"10.1145\/1363686.1363850"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-27812-2_12","volume-title":"Theory Is Forever","author":"M Ito","year":"2004","unstructured":"Ito, M., Shikishima-Tsuji, K.: Some results on directable automata. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 125\u2013133. Springer, Heidelberg (2004)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01071771","volume":"23","author":"AA Klyachko","year":"1987","unstructured":"Klyachko, A.A., Rystsov, I.K., Spivak, M.A.: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton. Cybernetics 23, 165\u2013171 (1987)","journal-title":"Cybernetics"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kushik, N.: Methods for deriving homing and distinguishing experiments for nondeterministic FSMs. Ph.D. thesis, Tomsk State University (2013)","DOI":"10.1007\/978-3-642-41707-8_3"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kushik, N., El-Fakih, K., Yevtushenko, N., Cavalli, A.: On adaptive experiments for nondeterministic finite state machines. Int. J. Softw. Tools Technol. Transf. (2014) (in press)","DOI":"10.1007\/978-3-642-41707-8_3"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Kushik, N., Yevtushenko, N.: On the length of homing sequences for nondeterministic finite state machines. In: Proceedings of the 18th International Conference on Implementation and Application of Automata. pp. 220\u2013231 (2013)","DOI":"10.1007\/978-3-642-39274-0_20"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1134\/S0361768814060140","volume":"40","author":"NG Kushik","year":"2014","unstructured":"Kushik, N.G., Kulyamin, V.V., Evtushenko, N.V.: On the complexity of existence of homing sequences for nondeterministic finite state machines. Program. Comput. Softw. 40, 333\u2013336 (2014)","journal-title":"Program. Comput. Softw."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. Comput."},{"issue":"15","key":"16_CR12","first-page":"44","volume":"4","author":"PV Martugin","year":"2008","unstructured":"Martugin, P.V.: Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata. J. Appl. Ind. Math 4(15), 44\u201356 (2008). (in Russian)","journal-title":"J. Appl. Ind. Math"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer-Verlag, Berlin (1980)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-24580-0_12","volume-title":"Testing Software and Systems","author":"A Petrenko","year":"2011","unstructured":"Petrenko, A., Yevtushenko, N.: Adaptive testing of deterministic implementations specified by nondeterministic FSMs. In: Wolff, B., Za\u00efdi, F. (eds.) ICTSS 2011. LNCS, vol. 7019, pp. 162\u2013178. Springer, Heidelberg (2011)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S Sandberg","year":"2005","unstructured":"Sandberg, S.: 1 homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/stvr.374","volume":"17","author":"N Spitsyna","year":"2007","unstructured":"Spitsyna, N., El-Fakih, K., Yevtushenko, N.: Studying the separability relation between finite state machines. Softw. Test. Verification Reliab. 17(4), 227\u2013241 (2007)","journal-title":"Softw. Test. Verification Reliab."},{"key":"16_CR17","volume-title":"Abstract Automata","author":"P Starke","year":"1972","unstructured":"Starke, P.: Abstract Automata. American Elsevier, North-Holland (1972)"},{"key":"16_CR18","volume-title":"Finite Automata: Behavior and Synthesis","author":"B Trahtenbrot","year":"1970","unstructured":"Trahtenbrot, B., Barzdin, J.: Finite Automata: Behavior and Synthesis. Nauka, Moscow (1970)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSE.2003.1166585","volume":"19","author":"F Zhang","year":"2003","unstructured":"Zhang, F., Cheung, T.: Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines. IEEE Trans. Softw. Eng. 19(1), 1\u201314 (2003)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22360-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T20:25:35Z","timestamp":1674246335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22360-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223599","9783319223605"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22360-5_16","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":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}