{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:42Z","timestamp":1725665022538},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631743"},{"type":"electronic","value":"9783540692058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63174-7_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:18:16Z","timestamp":1330280296000},"page":"120-131","source":"Crossref","is-referenced-by-count":2,"title":["Implementing sequential and parallel programs for the homing sequence problem"],"prefix":"10.1007","author":[{"given":"B.","family":"Ravikumar","sequence":"first","affiliation":[]},{"given":"X.","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"M. A. Bender and D. K. Slonim, \u201cThe power of team exploration: Two robots can learn unlabeled directed graphs\u201d, 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 75\u201385 (1994).","DOI":"10.1109\/SFCS.1994.365703"},{"key":"10_CR2","unstructured":"G. Blelloach and J. Harwick, \u201cClass Notes: Programming Parallel Algorithms\u201d, Technical Report CMU-CS-93-115, Carnegie Mellon University."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire and L. Sellie, \u201cEfficient Learning of typical automata from random walks\u201d, Proc. of 25th Annual ACM Symposium on Theory of Computing, pp. 315\u2013324 (1993).","DOI":"10.1145\/167088.167191"},{"key":"10_CR4","volume-title":"Design and validation of protocols","author":"G. Holzmann","year":"1990","unstructured":"G. Holzmann, Design and validation of protocols, Englewood Cliffs, NJ, Prentice-Hall (1990)."},{"key":"10_CR5","unstructured":"Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill Publishers Inc. Second Edition (1978)."},{"key":"10_CR6","first-page":"129","volume-title":"Automata Studies","author":"E. F. Moore","year":"1956","unstructured":"E. F. Moore, \u201cGedanken-experiments on sequential machines\u201d, pp. 129\u2013153, Automata Studies, Ed: McCarthy and Shannon, Princeton University Press, Princeton, NJ (1956)."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"I. Pomeranz and S. Reddy, \u201cApplication of homing sequences in the fault-detection of sequential circuits, IEEE Transactions on Computers, (1994).","DOI":"10.1109\/12.280804"},{"key":"10_CR8","unstructured":"B. Ravikumar, \u201cPerformance bounds of algorithms for testing automata\u201d, (in preparation)."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"B. Ravikumar and X. Xiong, \u201cA parallel algorithm for minimization of finite automata\u201d, in the Proceedings of the 10th International Parallel Processing Symposium (IPPS '96), Honolulu, Hawaii, April 1996, pages 187\u2013191.","DOI":"10.1109\/IPPS.1996.508056"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"B. Ravikumar and X. Xiong, \u201cRandomized parallel algorithms for the homing sequence problem\u201d, to appear in the International Conference on Parallel Processing (ICPP'96), Bloomingdale, Illinois, August 1996.","DOI":"10.1109\/ICPP.1996.537385"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R. L. Rivest","year":"1993","unstructured":"R. L. Rivest and R. E. Schapire, \u201cInference of finite automata using homing sequences\u201d, Information and Computation, vol. 103, pp. 299\u2013347, (1993).","journal-title":"Information and Computation"},{"key":"10_CR12","unstructured":"A. Tridgell and R.P. Brent, \u201cAn Implementation of a General-Purpose Parallel Sorting Algorithm\u201d, Report TR-CS-93-01, Computer Science Laboratory, Australian National University, February, 1993."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63174-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:42:47Z","timestamp":1619559767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63174-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631743","9783540692058"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63174-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}