{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:07Z","timestamp":1725663307338},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_35","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:17Z","timestamp":1330204037000},"page":"420-436","source":"Crossref","is-referenced-by-count":6,"title":["A polynomial time algorithm for the local testability problem of deterministic finite automata"],"prefix":"10.1007","author":[{"given":"Sam","family":"Kim","sequence":"first","affiliation":[]},{"given":"Robert","family":"McNaughton","sequence":"additional","affiliation":[]},{"given":"Robert","family":"McCloskey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"35_CR1","unstructured":"Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974)."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0012-365X(82)90281-3","volume":"4","author":"J. Brzozowski","year":"1973","unstructured":"Brzozowski, J. and Simon, I., Characterizations of locally testable events, Discrete Mathematics 4 (1973), pp. 243\u2013271.","journal-title":"Discrete Mathematics"},{"key":"35_CR3","unstructured":"Hopcroft, J., and Ullman, J., Introduction to Automata Theory, Languages, and Computation, Addison Weslely (1979)."},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0207007","volume":"7","author":"H. Hunt","year":"1978","unstructured":"Hunt, H. and Rosenkrantz, D., Computational parallels between the regular and context-free languages, SIAM J. COMPUT., 7 (1978), pp. 99\u2013114.","journal-title":"SIAM J. COMPUT."},{"key":"35_CR5","first-page":"738","volume":"EC-13","author":"C. Liu","year":"1964","unstructured":"Liu, C., k-th Order Finite Automaton, IEEE Trans. EC-13, (1964), pp. 738\u2013740.","journal-title":"IEEE Trans."},{"key":"35_CR6","unstructured":"Martin, R., Studies in Feedback-Shift-Register Synthesis of Sequential Machines, M.I.T. Press, (1969)."},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"McNaughton, R., Algebraic decision procedures for local testability, Mathematical Systems Theory, Vol.8 (1974), pp. 60\u201376.","journal-title":"Mathematical Systems Theory"},{"key":"35_CR8","unstructured":"McNaughton, R. and Papert, S., Counter-free Automata, M.I.T. Press, (1971)"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1109\/T-C.1971.223286","volume":"C-20","author":"P. Menon","year":"1971","unstructured":"Menon, P., and Friedman, A., Fault detection in iterative logic arrays, IEEE Trans. on Computers, C-20 (1971), pp. 524\u2013535.","journal-title":"IEEE Trans. on Computers"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(85)90003-9","volume":"35","author":"J. Stern","year":"1985","unstructured":"Stern, J., Characterizations of some classes of regular events, Theoretical Computer Science, 35 (1985), pp. 17\u201342.","journal-title":"Theoretical Computer Science"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"Stern, J., Complexity of some problems from the theory of automata, Information and control, 66 (1985), pp. 163\u2013176.","journal-title":"Information and control"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y. Zalcstein","year":"1972","unstructured":"Zalcstein, Y., Locally testable languages, Journal of Computer and System Sciences, 6 (1972), pp. 151\u2013167.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:36Z","timestamp":1619571876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}