{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:33:02Z","timestamp":1773653582645,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642222559","type":"print"},{"value":"9783642222566","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_20","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:37:04Z","timestamp":1310996224000},"page":"215-224","source":"Crossref","is-referenced-by-count":12,"title":["Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Kushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"El-Fakih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Yevtushenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"129","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), vol.\u00a01, pp. 129\u2013153. Princeton University Press, Princeton (1956)"},{"key":"20_CR2","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw- Hill, New York (1978)"},{"key":"20_CR3","volume-title":"Foundations of Software Testing","author":"A. Mathur","year":"2008","unstructured":"Mathur, A.: Foundations of Software Testing. Addison-Wesley, Reading (2008)"},{"issue":"3","key":"20_CR4","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. on Computers\u00a043(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. on Computers"},{"key":"20_CR5","series-title":"Lecture Notes in Compute Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-64359-1_709","volume-title":"Parallel algorithms for finite automata problems","author":"B. Ravikumar","year":"1998","unstructured":"Ravikumar, B.: IPPS-WS 1998 and SPDP-WS 1998. Lecture Notes in Compute Science, vol.\u00a01388, p. 373. Springer, Berlin (1998)"},{"key":"20_CR6","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.\u00a03472, pp. 5\u201333. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/320932.320938","volume":"5","author":"S. Ginsburg","year":"1958","unstructured":"Ginsburg, S.: On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. Journal of the ACM\u00a05(3), 266\u2013280 (1958)","journal-title":"Journal of the ACM"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/321088.321098","volume":"8","author":"T.N. Hibbard","year":"1961","unstructured":"Hibbard, T.N.: Lest upper bounds on minimal terminal state experiments of two classes of sequential machines. Journal of the ACM\u00a08(4), 601\u2013612 (1961)","journal-title":"Journal of the ACM"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Gill, A.: State-identification experiments in finite automata. Information and Control, 132\u2013154 (1961)","DOI":"10.1016\/S0019-9958(61)80003-X"},{"key":"20_CR10","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01125412","volume":"28","author":"I. Rystsov","year":"1992","unstructured":"Rystsov, I.: Rank of finite automata. Cybernetics and Systems Analysis\u00a028(3), 323\u2013328 (1992)","journal-title":"Cybernetics and Systems Analysis"},{"key":"20_CR12","first-page":"301","volume":"12","author":"H.V. Burkhard","year":"1976","unstructured":"Burkhard, H.V.: Zum Langenproblem homogener Experimente an determinierten und nicht-deterministischen. EIK\u00a012, 301\u2013306 (1976)","journal-title":"EIK"},{"key":"20_CR13","first-page":"105","volume":"14","author":"B. Imresh","year":"1999","unstructured":"Imresh, B., Steinby, M.: Directable non-deterministic automata. Acta Informatica\u00a014, 105\u2013115 (1999)","journal-title":"Acta Informatica"},{"key":"20_CR14","first-page":"37","volume":"16","author":"B. Imresh","year":"2003","unstructured":"Imresh, B., Imresh, C., Ito, M.: On directable non-deterministic trapped automata. Acta Informatica\u00a016, 37\u201345 (2003)","journal-title":"Acta Informatica"},{"key":"20_CR15","first-page":"3","volume-title":"Abstract Automata","author":"P. Starke","year":"1972","unstructured":"Starke, P.: Abstract Automata, pp. 3\u2013419. American Elsevier, Amsterdam (1972)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proc. the 27th ACM Symposium on Theory of Computing, pp. 363\u2013372 (1995)","DOI":"10.1145\/225058.225161"},{"issue":"4","key":"20_CR17","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. Software Testing, Verification and Reliability\u00a017(4), 227\u2013241 (2007)","journal-title":"Software Testing, Verification and Reliability"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:41:25Z","timestamp":1553913685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}