<p>I have not understood how reversibility works in case of an automaton. Kindly explain. </p>

CC BY-SA 4.0
2018-05-19T18:17:08.187Z
Did you try reading https://en.wikipedia.org/wiki/Reversible_cellular_automaton ?
David Eppstein
CC BY-SA 4.0
2018-05-21T16:26:39.853Z
Here is a reference to a notion of symmetric computation: https://www.sciencedirect.com/science/article/pii/0304397582900585
Michael Wehar
CC BY-SA 4.0
2018-05-21T16:29:26.793Z
I once considered the following notion of symmetric finite automata: A symmetric finite automaton "is an NFA satisfying the following. Each alphabet character $c$ has a corresponding alphabet character $c^r$ such that if there is a transition from state $p$ to $q$ with alphabet character $c$, then there is a transition from state $q$ to $p$ with alphabet character $c^r$."
Michael Wehar
<reversible-computing>
What is reversible automaton and how it works?
Moumita Chakraborty 
# What is reversible automaton and how it works?

(Asked by: username_0 on 2018-05-19)

I have not understood how reversibility works in case of an automaton. Kindly explain.

**Tags:** reversible-computing

> **Comments:**
> **username_1**: Did you try reading https://en.wikipedia.org/wiki/Reversible_cellular_automaton ?  
> **username_2**: Here is a reference to a notion of symmetric computation: https://www.sciencedirect.com/science/article/pii/0304397582900585  
> **username_2**: I once considered the following notion of symmetric finite automata: A symmetric finite automaton "is an NFA satisfying the following. Each alphabet character $c$ has a corresponding alphabet character $c^r$ such that if there is a transition from state $p$ to $q$ with alphabet character $c$, then there is a transition from state $q$ to $p$ with alphabet character $c^r$."  

---

## 0 answers

