{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:19:25Z","timestamp":1775053165814,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540411833","type":"print"},{"value":"9783540400646","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_5","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:42Z","timestamp":1186892742000},"page":"35-46","source":"Crossref","is-referenced-by-count":1,"title":["Traversing Directed Eulerian Mazes (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Sandeep","family":"Bhatt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shimon","family":"Even","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Greenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafi","family":"Tayar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1137\/S009753979223277X","volume":"23","author":"Y. Afek","year":"1994","unstructured":"Y. Afek and E. Gafni, Distributed Algorithms for Unidirectional Networks, SIAM J. Comput., Vol. 23, No. 6, 1994, pp. 1152\u20131178.","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"M. Blum and W.J. Sakoda, On the Capability of Finite Automata in 2 and 3 Dimensional Space. In Proceeding of the Eighteenth Annual Symposium on Foundations of Computer Science, 1977. pp. 147\u2013161.","DOI":"10.1109\/SFCS.1977.20"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"X. Deng and C.H. Papadimitriou, Exploring an Unknown Graph. In Proceeding of the Thirty First Annual Symposium on Foundation of Computer Science, 1990, pp. 355\u2013361.","DOI":"10.1109\/FSCS.1990.89554"},{"key":"5_CR4","unstructured":"S. Even, Graph Algorithms, Computer Science press, 1979."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jagm.1996.0840","volume":"24","author":"S. Even","year":"1997","unstructured":"S. Even, A. Litman and P. Winkler, Computing with Snakes in Directed Networks of Automata. J. of Algorithms, Vol. 24, 1997, pp. 158\u2013170.","journal-title":"J. of Algorithms"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"A. Hemmerling, Labyrinth Problems; Labyrinth-Searching Abilities of Automata, Teubner-Texte zur Mathematik, Band 114, 1989.","DOI":"10.1007\/978-3-322-94560-0"},{"key":"5_CR7","unstructured":"M.O. Rabin, Maze Threading Automata. An unpublished lecture presented at MIT and UC Berkeley, 1967."},{"key":"5_CR8","unstructured":"R. Tayar, Scanning Directed Eulerian Mazes by a Finite-State Robot, Master thesis, Computer Science Department, Technion, Haifa, Israel}. In preparation."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:38:00Z","timestamp":1550752680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}