{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T09:56:57Z","timestamp":1753437417492},"reference-count":24,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.386.12","type":"journal-article","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T09:41:14Z","timestamp":1693734074000},"page":"142-154","source":"Crossref","is-referenced-by-count":1,"title":["Reversible Two-Party Computations"],"prefix":"10.4204","volume":"386","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2023,9,3]]},"reference":[{"issue":"3","key":"Angluin:1982:irl","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","article-title":"Inference of reversible languages","volume":"29","author":"Angluin","year":"1982","journal-title":"J. ACM"},{"key":"Bennet:1973:lrc","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","article-title":"Logical Reversibility of Computation","volume":"17","author":"Bennett","year":"1973","journal-title":"IBM J. Res. Dev."},{"issue":"4","key":"bordihn:2021:rpcfas","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00236-021-00396-9","article-title":"Reversible parallel communicating finite automata systems","volume":"58","author":"Bordihn","year":"2021","journal-title":"Acta Inf."},{"issue":"5","key":"chatterjee:2017:rwka","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s00236-016-0267-0","article-title":"Reversible Watson-Crick automata","volume":"54","author":"Chatterjee","year":"2017","journal-title":"Acta Inf."},{"issue":"5","key":"chatterjee:2017:wkpa","doi-asserted-by":"publisher","first-page":"868","DOI":"10.14736\/kyb-2017-5-0868","article-title":"Watson-Crick pushdown automata","volume":"53","author":"Chatterjee","year":"2017","journal-title":"Kybernetika"},{"key":"czeizler:2009:odcwca","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1016\/j.tcs.2009.05.001","article-title":"On the descriptional complexity of Watson-Crick automata","volume":"410","author":"Czeizler","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"Freund:1997:wcfa:proc","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1090\/dimacs\/048\/22","article-title":"Watson-Crick Finite Automata","volume-title":"DIMACS Workshop on DNA Based Computers","author":"Freund","year":"1997"},{"key":"holzer:2018:mrdfa","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054118400063","article-title":"Minimal Reversible Deterministic Finite Automata","volume":"29","author":"Holzer","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"kocman:2022:ajwkfam","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00236-021-00413-x","article-title":"A jumping 5' \u2192 3' Watson-Crick finite automata model","volume":"59","author":"Kocman","year":"2022","journal-title":"Acta Inf."},{"key":"kondacs:1997:pqfsa","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/SFCS.1997.646094","article-title":"On the Power of Quantum Finite State Automata","volume-title":"Foundations of Computer Science (FOCS 1997)","author":"Kondacs","year":"1997"},{"key":"kutrib:2014:arca","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-13350-8_7","article-title":"Aspects of Reversibility for Classical Automata","volume-title":"Computing with New Resources","volume":"8808","author":"Kutrib","year":"2014"},{"key":"kutrib:2010:tpwcc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-18098-9_21","article-title":"Two-Party Watson-Crick Computations","volume-title":"Implementation and Application of Automata (CIAA 2010)","volume":"6482","author":"Kutrib","year":"2011"},{"key":"kutrib:2012:rpda","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","article-title":"Reversible Pushdown Automata","volume":"78","author":"Kutrib","year":"2012","journal-title":"J. Comput. Syst. Sci."},{"key":"kutrib:2017:owrmhfa","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2016.11.006","article-title":"One-way reversible multi-head finite automata","volume":"682","author":"Kutrib","year":"2017","journal-title":"Theor. Comput. Sci."},{"key":"kutrib:2022:rcoowca","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"126","DOI":"10.4204\/EPTCS.367.9","article-title":"Reversible Computations of One-Way Counter Automata","volume-title":"NCMA 2022","volume":"367","author":"Kutrib","year":"2022"},{"key":"kutrib:2016:rqa","doi-asserted-by":"publisher","first-page":"341","DOI":"10.3233\/FI-2016-1438","article-title":"Reversible Queue Automata","volume":"148","author":"Kutrib","year":"2016","journal-title":"Fund. Inform."},{"key":"lecerf:lmmtr:1963","first-page":"2597","article-title":"Logique Math\u00e9matique: Machines de Turing r\u00e9versible","volume":"257","author":"Lecerf","year":"1963","journal-title":"C. R. S\u00e9ances Acad. Sci."},{"key":"leupold:2010:ftwcsr","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3233\/FI-2010-336","article-title":"5'3' Watson-Crick Automata with Several Runs","volume":"104","author":"Leupold","year":"2010","journal-title":"Fund. Inform."},{"key":"morita:2011:twrmhfa","doi-asserted-by":"publisher","first-page":"241","DOI":"10.3233\/FI-2011-541","article-title":"Two-Way Reversible Multi-Head Finite Automata","volume":"110","author":"Morita","year":"2011","journal-title":"Fund. Inform."},{"key":"nagy:2007:ofpt3pswcfa:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-77962-9_27","article-title":"On 5'3' Sensing Watson-Crick Finite Automata","volume-title":"DNA Computing","volume":"4848","author":"Nagy","year":"2007"},{"key":"nagy:2013:h5s3sswcfal","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1093\/logcom\/exr049","article-title":"On a hierarchy of 5' \u2192 3' sensing Watson-Crick finite automata languages","volume":"23","author":"Nagy","year":"2013","journal-title":"J. Log. Comput."},{"key":"nagy:2020:wkpa","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ins.2020.06.031","article-title":"5'\u21923' Watson-Crick pushdown automata","volume":"537","author":"Nagy","year":"2020","journal-title":"Inf. Sci."},{"key":"nagy:2021:od1lswkfst","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2021007","article-title":"On deterministic 1-limited sensing 5' \u2192 3' Watson-Crick finite-state transducers","volume":"55","author":"Nagy","year":"2021","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"nagy:2017:answkac","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"195","DOI":"10.4204\/EPTCS.252.19","article-title":"A New Sensing 5' \u2192 3' Watson-Crick Automata Concept","volume-title":"AFL 2017","volume":"252","author":"Nagy","year":"2017"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T16:33:06Z","timestamp":1694104386000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2309.02747v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,3]]},"references-count":24,"URL":"https:\/\/doi.org\/10.4204\/eptcs.386.12","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,3]]}}}