{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:40Z","timestamp":1725905440819},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_10","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"147-159","source":"Crossref","is-referenced-by-count":1,"title":["Two-Way Two-Tape Automata"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]},{"given":"L\u00e9o","family":"Exibard","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Serre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 155\u2013160. IEEE (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cohen, A., Collard, J.F.: Instance-wise reaching definition analysis for recursive programs using context-free transductions. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 332\u2013339. IEEE (1998)","DOI":"10.1109\/PACT.1998.727269"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9, 47\u201368 (1965)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"10_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Log. 2(2), 216\u2013254 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6, 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.: Removing bidirectionality from nondeterministic finite automata. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). doi: 10.1007\/11549345_47"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-44693-1_35","volume-title":"STACS 2001","author":"J Kari","year":"2001","unstructured":"Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396\u2013406. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44693-1_35"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-27812-2_13","volume-title":"Theory Is Forever","author":"J Kari","year":"2004","unstructured":"Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata. In: Karhum\u00e4ki, J., Maurer, H., P\u0103un, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 134\u2013144. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27812-2_13"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-24897-9_9","volume-title":"Algebraic Foundations in Computer Science","author":"J Kari","year":"2011","unstructured":"Kari, J., Salo, V.: A survey on picture-walking automata. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 183\u2013213. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24897-9_9"},{"key":"10_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"D Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, Chap. 7, pp. 230\u2013268. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Roche, E., Schabes, Y.: Finite-State Language Processing, Chap. 7. MIT Press, Cambridge (1997)","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"},{"issue":"3","key":"10_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M Sipser","year":"1980","unstructured":"Sipser, M.: Halting space-bounded computations. Theor. Comput. Sci. 10(3), 335\u2013338 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T23:04:57Z","timestamp":1569884697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}