C. H. Bennett
1973
Logical reversibility of computation
IBM J. Res. Dev.
17
525–532
10.1147/rd.176.0525
H.K. Büning
L. Priese
1980
Universal asynchronous iterative arrays of Mealy automata
Acta Informatica
13
269–285
10.1007/BF00288646
E. Fredkin
T. Toffoli
1982
Conservative logic
Int. J. Theoret. Phys.
21
219–253
10.1007/BF01857727
R.M. Keller
1974
Towards a theory of universal speed-independent modules
IEEE Trans. Computers
C-23
21–33
10.1109/T-C.1974.223773
J. Lee
F. Peper
S. Adachi
K. Morita
2008
An asynchronous cellular automaton implementing 2-state 2-input 2-output reversed-twin reversible elements
Proc. ACRI 2008, LNCS 5191
Springer-Verlag
67–76
10.1007/978-3-540-79992-4_9
K. Morita
2001
A simple reversible logic element and cellular automata for reversible computing
Proc. 3rd Int. Conf. on Machines, Computations, and Universality, LNCS 2055
Springer-Verlag
102–113
10.1007/3-540-45132-3_6
K. Morita
2003
A new universal logic element for reversible computing
Grammars and Automata for String Processing (eds. C. Martin-Vide, and V. Mitrana)
Taylor & Francis, London
285–294
10.1201/9780203009642.ch28
K. Morita
2008
Reversible computing and cellular automata — A survey
Theoret. Comput. Sci.
395
101–131
10.1016/j.tcs.2008.01.041
K. Morita
2010
Constructing a reversible Turing machine by a rotary element, a reversible logic element with memory
Hiroshima University Institutional Repository, http://ir.lib.hiroshima-u.ac.jp/00029224
K. Morita
2012
Reversible Computing (in Japanese)
Kindai Kagaku-sha Co., Ltd., Tokyo, ISBN978-4-7649-0422-4
K. Morita
T. Ogiro
A. Alhazov
T. Tanizawa
2012
Non-degenerate 2-state reversible logic elements with three or more symbols are all universal
J. Multiple-Valued Logic and Soft Computing
18
37–54
K. Morita
T. Ogiro
K. Tanaka
H. Kato
2005
Classification and universality of reversible logic elements with one-bit memory
Proc. 4th Int. Conf. on Machines, Computations, and Universality, LNCS 3354
Springer-Verlag
245–256
10.1007/978-3-540-31834-7_20
Y. Mukai
K. Morita
2011
Universality of 2-symbol reversible logic elements with memory (in Japanese)
LA Summer Symposium, Kosai, Sizuoka Prefecture
Y. Mukai
K. Morita
2012
Hierarchy of reversible logic elements with memory (in Japanese)
LA Winter Symposium, Kyoto, http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1799-28.pdf
Y. Mukai
K. Morita
2012
Realizing reversible logic elements with memory in the billiard ball model
Int. J. of Unconventional Computing
8
1
47–59
T. Toffoli
1977
Computation and construction universality of reversible cellular automata
J. Comput. Syst. Sci.
15
213–231
10.1016/S0022-0000(77)80007-X
T. Toffoli
1980
Reversible computing
Automata, Languages and Programming, LNCS 85
Springer-Verlag
632–644
10.1007/3-540-10003-2_104
T. Toffoli
1981
Bicontinuous extensions of invertible combinatorial functions
Math. Syst. Theory
14
12–23
10.1007/BF01752388