{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:52:25Z","timestamp":1773615145763,"version":"3.50.1"},"reference-count":17,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.3103\/s0146411618070167","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:04:17Z","timestamp":1551683057000},"page":"589-595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deriving Synchronizing and Homing Sequences for Input\/Output Automata"],"prefix":"10.3103","volume":"52","author":[{"given":"N. G.","family":"Kushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. V.","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. B.","family":"Burdonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Kossatchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2019,3,4]]},"reference":[{"key":"7025_CR1","first-page":"44","volume":"15","author":"P.V. Martyugin","year":"2008","unstructured":"Martyugin, P.V., Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata, Diskretn. Anal. Issled. Oper., 2008, vol. 15, no. 4, pp. 44\u201356.","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"7025_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/S0019-9958(61)80003-X","volume":"4","author":"A. Gill","year":"1961","unstructured":"Gill, A., State-identification experiments in finite automata, Inf. Control, 1961, vol. 4, pp. 132\u2013154.","journal-title":"Inf. Control"},{"key":"7025_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00224-013-9516-6","volume":"54","author":"P. Martyugin","year":"2014","unstructured":"Martyugin, P., Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata, Theory Comput. Syst., 2014, vol. 54, no. 2, pp.\u00a0293\u2013304.","journal-title":"Theory Comput. Syst."},{"key":"7025_CR4","doi-asserted-by":"crossref","unstructured":"Hierons, R.M., Jourdan, G.V., Ural, H., and Yenig\u00fcn, H., Using adaptive distinguishing sequences in checking sequence constructions, Proc. of the 2008 ACM symposium on Applied computing (SAC), 2008, pp. 682\u2013687.","DOI":"10.1145\/1363686.1363850"},{"key":"7025_CR5","doi-asserted-by":"crossref","unstructured":"Ito, M. and Shikishima-Tsuji, K., Some results on directable automata, in Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, Berlin, Heidelberg: Springer; Lect. Notes Comput. Sci., 2004, vol. 3113, pp. 125\u2013133.","DOI":"10.1007\/978-3-540-27812-2_12"},{"key":"7025_CR6","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z., Switching and Finite Automata Theory, New York: McGraw-Hill, 1978."},{"key":"7025_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10009-014-0357-7","volume":"18","author":"N. Kushik","year":"2016","unstructured":"Kushik, N., El-Fakih, K., Yevtushenko, N., and Cavalli, A.R., On adaptive experiments for non-deterministic finite state machines, Int. J. Software Tools Technol. Transfer, 2016, vol. 18, no. 3, pp. 251\u2013264.","journal-title":"Int. J. Software Tools Technol. Transfer"},{"key":"7025_CR8","doi-asserted-by":"crossref","unstructured":"Kushik, N., L\u00f3pez, J., Cavalli, A.R., and Yevtushenko, N., Improving protocol passive testing through \u2018gedanken\u2019 experiments with finite state machines, Proc. 2016 IEEE International Conference on Software Quality, Reliability and Security (QRS), 2016, pp. 315\u2013322.","DOI":"10.1109\/QRS.2016.43"},{"key":"7025_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-22256-6_20","volume":"6807","author":"N. Kushik","year":"2011","unstructured":"Kushik, N., El-Fakih, K., and Yevtushenko, N., Preset and adaptive homing experiments for nondeterministic finite state machines, Implementation and Application of Automata. CIAA 2011; Lect. Notes Comput. Sci., 2011, vol. 6807, pp. 215\u2013224.","journal-title":"Lect. Notes Comput. Sci."},{"key":"7025_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-39274-0_20","volume":"7982","author":"N. Kushik","year":"2013","unstructured":"Kushik, N. and Yevtushenko, N., On the length of homing sequences for nondeterministic finite state machines, Implementation and Application of Automata. CIAA 2013; Lect. Notes Comput. Sci., 2013, vol. 7982, pp. 220\u2013231.","journal-title":"Lect. Notes Comput. Sci."},{"key":"7025_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D. Lee","year":"1994","unstructured":"Lee, D. and Yannakakis, M., Testing finite-state machines: State identification and verification, IEEE Trans. Comput., 1994, vol. 43, no. 3, pp. 306\u2013320.","journal-title":"IEEE Trans. Comput."},{"key":"7025_CR12","series-title":"Gedanken-experiments on sequential machines","volume-title":"Automata Studies (Annals of Mathematical Studies)","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F., Gedanken-experiments on sequential machines, in Automata Studies (Annals of Mathematical Studies), Princeton University Press, 1956, pp. 129\u2013153."},{"key":"7025_CR13","doi-asserted-by":"crossref","unstructured":"Sandberg, S., Homing and synchronizing sequences, in Model-Based Testing of Reactive Systems; Lect. Notes Comput. Sci., 2005, vol. 3472, pp. 5\u201333.","DOI":"10.1007\/11498490_2"},{"key":"7025_CR14","unstructured":"Tretmans, J., Test generation with inputs, outputs and repetitive quiescence, Software\u2014Concepts Tools, 1996, vol. 17, no. 3, pp. 103\u2013120."},{"key":"7025_CR15","volume-title":"Synchronizing automata and the \u010cern\u00fd conjecture","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V., Synchronizing automata and the \u010cern\u00fd conjecture, Language and Automata Theory and Applications. LATA, 2008; Lect. Notes Comput. Sci., 2008, vol. 5196, pp. 11\u201327."},{"key":"7025_CR16","unstructured":"Kushik, N.G., Yevtushenko, N.V., Burdonov, I.B., and Kossatchev, A., S, Synchronizing and homing experiments for input\/output automata, Syst. Inf., 2017, no. 10, pp. 1\u20139."},{"key":"7025_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ipl.2017.07.001","volume":"127","author":"H. Yenig\u00fcn","year":"2017","unstructured":"Yenig\u00fcn, H., Yevtushenko, N., and Kushik, N., The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs, Inf. Process. Lett., 2017, vol. 127, pp. 49\u201353.","journal-title":"Inf. Process. Lett."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411618070167","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070167.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:55:56Z","timestamp":1773611756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411618070167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["7025"],"URL":"https:\/\/doi.org\/10.3103\/s0146411618070167","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"3 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}