{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:04:26Z","timestamp":1750478666172,"version":"3.41.0"},"reference-count":53,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T00:00:00Z","timestamp":1362009600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:p>Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalising the classical Turing machine concept so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example.<\/jats:p>","DOI":"10.1017\/s0960129512000096","type":"journal-article","created":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T23:00:06Z","timestamp":1362092406000},"page":"204-246","source":"Crossref","is-referenced-by-count":2,"title":["The monoidal structure of Turing machines"],"prefix":"10.1017","volume":"23","author":[{"given":"MIKL\u00d3S","family":"BARTHA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,2,28]]},"reference":[{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-45","DOI":"10.1147\/rd.53.0183"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-40","DOI":"10.1016\/0022-4049(80)90101-2"},{"key":"S0960129512000096_manual_ref-17","first-page":"585","article-title":"Soliton circuits and network-based automata: review and perspectives","volume":"2","author":"Bartha","year":"2010","journal-title":"Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-2","DOI":"10.1016\/j.tcs.2005.07.002"},{"volume-title":"Advanced Linear Algebra","year":"2005","author":"Roman","key":"S0960129512000096_manual_ref-53"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-20","DOI":"10.1147\/rd.176.0525"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-9","DOI":"10.1016\/0890-5401(92)90006-2"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-24","DOI":"10.3233\/FI-1990-13204"},{"key":"S0960129512000096_manual_ref-7","first-page":"203","article-title":"A finite axiomatization of flowchart schemes","volume":"8","author":"Bartha","year":"1987","journal-title":"Acta Cybernetica"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-31","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129512000096_manual_ref-46","first-page":"41","article-title":"Optimizing synchronous systems","volume":"1","author":"Leiserson","year":"1983","journal-title":"Journal of VLSI and computer systems"},{"key":"S0960129512000096_manual_ref-49","first-page":"28","article-title":"Natural associativity and commutativity","volume":"49","author":"Mac","year":"1963","journal-title":"Rice University Studies"},{"unstructured":"Bartha, M. and J\u00fcrgensen, H. (1989) Characterizing finite undirected multigraphs as indexed algebras. Technical Report 252, Department of Computer Science, The University of Western Ontario, London, Ontario, Canada. (Available online at http:\/\/www.cs.mun.ca\/~bartha\/linked\/ind.pdf.)","key":"S0960129512000096_manual_ref-14"},{"unstructured":"Bartha, M. (2009) Equivalence relations of Mealy automata. In: Local Proceedings, First Workshop on Non-Classical Models of Automata and Applications, Wroclaw, Poland 31\u201345. (Available online at http:\/\/www.cs.mun.ca\/~bartha\/linked\/wroc.pdf.)","key":"S0960129512000096_manual_ref-11"},{"key":"S0960129512000096_manual_ref-42","first-page":"237","article-title":"Graph decomposition and descriptional complexity of soliton automata","volume":"12","author":"Kr\u00e9sz","year":"2007","journal-title":"Journal of Automata, Languages and Combinatorics"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-8","DOI":"10.1016\/0304-3975(87)90104-6"},{"unstructured":"Burstall, R. M. , Goguen, J. A. and Tarlecki, A. (1989) Some fundamental tools for the semantics of computation. Part 3: Indexed categories. Report ECS-LFCS-89-90, Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh, United Kingdom.","key":"S0960129512000096_manual_ref-23"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-38","DOI":"10.1051\/ita:2002009"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-3","DOI":"10.1007\/11548133_1"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-26","DOI":"10.1007\/978-94-017-3025-9"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-54","DOI":"10.1007\/978-3-642-12821-9_4"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-34","DOI":"10.1017\/S0960129503003931"},{"unstructured":"Bartha, M. (2012) Quantum Turing automata. Proceedings, 8th International Workshop on Developments of Computational Models (DCM 2012). Electronic Proceedings in Theoretical Computer Science (in press).","key":"S0960129512000096_manual_ref-12"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-50","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"S0960129512000096_manual_ref-16","first-page":"281","article-title":"Deterministic soliton graphs","volume":"30","author":"Bartha","year":"2006","journal-title":"Informatica"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-27","DOI":"10.1017\/S0960129506005251"},{"key":"S0960129512000096_manual_ref-32","first-page":"221","volume-title":"Logic Colloquium'88","author":"Girard","year":"1989"},{"unstructured":"Bartha, M. (2008) Simulation equivalence of automata and circuits. In: Local Proceedings, 12th International Conference on Automata and Formal Languages, Balatonf\u00fcred, Hungary 86\u201399. (Available online at http:\/\/www.cs.mun.ca\/~bartha\/linked\/afl08.pdf.)","key":"S0960129512000096_manual_ref-10"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-43","DOI":"10.1016\/j.ic.2008.03.014"},{"unstructured":"Bartha, M. and Kr\u00e9sz, M. (2011) Molecular switching by Turing automata. In: Local Proceedings, Third Workshop on Non-Classical Models of Automata and Applications, Milan, Italy 31\u201345. (Available online at http:\/\/www.cs.mun.ca\/~bartha\/linked\/mol.pdf.)","key":"S0960129512000096_manual_ref-18"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-19","DOI":"10.1007\/BF01692060"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-22","DOI":"10.1007\/978-3-642-78034-9"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-4","DOI":"10.1109\/LICS.2004.1319636"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-30","DOI":"10.1016\/0022-4049(92)90018-B"},{"doi-asserted-by":"crossref","unstructured":"Lafont, Y. (1989) Interaction nets. In: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages 95\u2013108.","key":"S0960129512000096_manual_ref-44","DOI":"10.1145\/96709.96718"},{"volume-title":"Matching Theory","year":"1986","author":"Lov\u00e1sz","key":"S0960129512000096_manual_ref-47"},{"key":"S0960129512000096_manual_ref-51","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0022-4049(85)90087-8","article-title":"Coherence for bicategories and indexed categories","volume":"37","author":"Mac","year":"1985","journal-title":"Journal of Pure and Applied Algebra"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-5","DOI":"10.1017\/S0960129502003730"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-36","DOI":"10.1016\/0001-8708(91)90003-P"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-35","DOI":"10.1017\/CBO9780511526619.005"},{"key":"S0960129512000096_manual_ref-6","first-page":"235","article-title":"Th\u00e9orie des magmo\u00efdes","volume":"12","author":"Arnold","year":"1978","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-33","DOI":"10.1007\/3-540-52335-9_49"},{"unstructured":"Lutz, C. and Derby, H. (1982) Janus: A Time-Reversible Language. (Available online at http:\/\/tinyurl.com\/janus82.)","key":"S0960129512000096_manual_ref-48"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-37","DOI":"10.1017\/S0305004100074338"},{"unstructured":"Bartha, M. and Gomb\u00e1s, \u00c9. (1991) The Gallai\u2013Edmonds algebra of graphs. Technical Report 9105, Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, Canada. (Available online at http:\/\/www.cs.mun.ca\/~bartha\/linked\/g-e.pdf.)","key":"S0960129512000096_manual_ref-13"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-52","DOI":"10.1017\/CBO9780511626661"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-25","DOI":"10.1016\/0022-0000(90)90010-I"},{"key":"S0960129512000096_manual_ref-41","first-page":"3","volume-title":"Automata Studies","author":"Kleene","year":"1956"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-15","DOI":"10.1016\/S0304-3975(02)00048-8"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-29","DOI":"10.1007\/s002360050106"},{"key":"S0960129512000096_manual_ref-28","first-page":"175","article-title":"Monadic computations and iterative algebraic theories","volume":"80","author":"Elgot","year":"1975","journal-title":"Logic Colloquium 1973"},{"volume-title":"Basic Concepts of Enriched Category Theory","year":"1982","author":"Kelly","key":"S0960129512000096_manual_ref-39"},{"doi-asserted-by":"publisher","key":"S0960129512000096_manual_ref-21","DOI":"10.1016\/0022-0000(85)90059-5"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129512000096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T16:06:18Z","timestamp":1750435578000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129512000096\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,28]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["S0960129512000096"],"URL":"https:\/\/doi.org\/10.1017\/s0960129512000096","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"type":"print","value":"0960-1295"},{"type":"electronic","value":"1469-8072"}],"subject":[],"published":{"date-parts":[[2013,2,28]]}}}