{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:04:49Z","timestamp":1725473089750},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496991"},{"type":"electronic","value":"9783540497035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940197_10","type":"book-chapter","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T07:23:21Z","timestamp":1164180201000},"page":"148-162","source":"Crossref","is-referenced-by-count":3,"title":["State-Identification Problems for Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"Moez","family":"Krichen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros","family":"Tripakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: 27th ACM Symposium on Theory of Computing (STOC 1995), pp. 363\u2013372 (1995)","DOI":"10.1145\/225058.225161"},{"key":"10_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. Information and Control\u00a04, 132\u2013154 (1961)","journal-title":"Information and Control"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T.V. Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for \u039b-free nondeterministic generalized machines. J. ACM\u00a015(3), 409\u2013413 (1968)","journal-title":"J. ACM"},{"key":"10_CR4","volume-title":"Switching and finite automata theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and finite automata theory, 2nd edn. McGraw-Hill, New York (1978)","edition":"2"},{"key":"10_CR5","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 - A survey. Proceedings of the IEEE\u00a084, 1090\u20131126 (1996)","journal-title":"Proceedings of the IEEE"},{"key":"10_CR6","volume-title":"Automata Studies","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies, vol.\u00a034. Princeton University Press, Princeton (1956)"},{"key":"10_CR7","volume-title":"Formal languages","author":"A. Salomaa","year":"1987","unstructured":"Salomaa, A.: Formal languages. Academic Press Professional, Inc., San Diego (1987)"}],"container-title":["Lecture Notes in Computer Science","Formal Approaches to Software Testing and Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940197_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:13Z","timestamp":1619509813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940197_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496991","9783540497035"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11940197_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}