{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:09:56Z","timestamp":1725937796347},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_14","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T21:45:50Z","timestamp":1456436750000},"page":"181-193","source":"Crossref","is-referenced-by-count":9,"title":["Minimal Separating Sequences for All Pairs of States"],"prefix":"10.1007","author":[{"given":"Rick","family":"Smetsers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Moerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David N.","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1145\/2480359.2429124","volume":"48","author":"Filippo Bonchi","year":"2013","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL, pp. 457\u2013468 (2013)","journal-title":"ACM SIGPLAN Notices"},{"issue":"12","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.infsof.2010.07.001","volume":"52","author":"R Dorofeeva","year":"2010","unstructured":"Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A., Yevtushenko, N.: FSM-based conformance testing methods: a survey annotated with experimental evaluation. Inf. Softw. Technol. 52(12), 1286\u20131297 (2010)","journal-title":"Inf. Softw. Technol."},{"key":"14_CR3","volume-title":"Introduction to the Theory of Finite-state Machines","author":"A Gill","year":"1962","unstructured":"Gill, A.: Introduction to the Theory of Finite-state Machines. McGraw-Hill, New York (1962)"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Informatica 2(2), 97\u2013109 (1973)","journal-title":"Acta Informatica"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/bxv041","volume":"58","author":"RM Hierons","year":"2015","unstructured":"Hierons, R.M., T\u00fcrker, U.C.: Incomplete distinguishing sequences for finite state machines. Comput. J. 58, 1\u201325 (2015)","journal-title":"Comput. J."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"John Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196 (1971)"},{"issue":"1\u20132","key":"14_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"T Knuutila","year":"2001","unstructured":"Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoret. Comput. Sci. 250(1\u20132), 333\u2013363 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"14_CR8","first-page":"306","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. Computers 43(3), 306\u2013320 (1994)","journal-title":"Computers"},{"key":"14_CR9","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Automata Stud. 34, 129\u2013153 (1956)","journal-title":"Automata Stud."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-25423-4_5","volume-title":"Formal Methods and Software Engineering","author":"W Smeenk","year":"2015","unstructured":"Smeenk, W., Moerman, J., Vaandrager, F., Jansen, D.N.: Applying automata learning to embedded control software. In: Butler, M., et al. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 67\u201383. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-25423-4_5"},{"key":"14_CR11","unstructured":"Valmari, A., Lehtinen, P.: Efficient minimization of DFAs with partial transition functions. In: STACS, pp. 645\u2013656 (2008)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:55:45Z","timestamp":1559404545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}