Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Time-reversal symmetry in dynamical systems: a survey
Proceedings of the workshop on Time-reversal symmetry in dynamical systems
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
On the Construction of Reversible Automata for Reversible Languages
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Introduction to reversible computing: motivation, progress, and challenges
Proceedings of the 2nd conference on Computing frontiers
Theory of cellular automata: a survey
Theoretical Computer Science
Reversible computing and cellular automata—A survey
Theoretical Computer Science
On the efficient construction of quasi-reversible automata for reversible languages
Information Processing Letters
Fast reversible language recognition using cellular automata
Information and Computation
Reversible Flowchart Languages and the Structured Reversible Program Theorem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On locally reversible languages
Theoretical Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Logical reversibility of computation
IBM Journal of Research and Development
Real-time reversible iterative arrays
Theoretical Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
Reversible Computation and Reversible Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
A simple and efficient universal reversible turing machine
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On time-symmetry in cellular automata
Journal of Computer and System Sciences
Reversible multi-head finite automata characterize reversible logarithmic space
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Two-Way Reversible Multi-Head Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Reversible computational models with discrete internal states are said to be time-symmetric, if they can go back and forth in time by applying the same transition function. The direction in time is adjusted by a weak transformation of the phase-space, that is, an involution. So, these machines themselves cannot distinguish whether they run forward or backward in time. From this viewpoint, finite state machines and pushdown machines are studied in detail. In essence, it turns out that there are reversible machines which are not time-symmetric, but equivalent time-symmetric machines can effectively be constructed. The notion of time-symmetry is discussed, several examples are given, and further results concerning unary inputs and descriptional complexity issues are shown.