Reversible Two-Party Computations
From MaRDI portal
Publication:6204131
DOI10.4204/eptcs.386.12arXiv2309.02747MaRDI QIDQ6204131
Martin Kutrib, Andreas Malcher
Publication date: 9 April 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.02747
Cites Work
- Unnamed Item
- Unnamed Item
- Reversible pushdown automata
- Reversible parallel communicating finite automata systems
- On the descriptional complexity of Watson-Crick automata
- One-way reversible multi-head finite automata
- Reversible Watson-Crick automata
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
- Aspects of Reversibility for Classical Automata
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- Two-Party Watson-Crick Computations
- Two-Way Reversible Multi-Head Finite Automata
- Inference of Reversible Languages
- Reversible Queue Automata
- Watson-Crick pushdown automata
- Minimal Reversible Deterministic Finite Automata
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
- On 5′→3′ Sensing Watson-Crick Finite Automata
- Logical Reversibility of Computation
