Invited Talks

Invited Talks

‪Kenichi Morita: How can we construct reversible Turing machines in a very simple reversible cellular automaton?

Kenichi Morita is a professor emeritus of Hiroshima University, Japan. He received his PhD degree from Osaka University in 1978. From 1974 to 1987, he was a research associate of the Faculty of Engineering Science, Osaka University. From 1987 to 1990, he was an associate professor, and from 1990 to 1993 a full professor of the Faculty of Engineering, Yamagata University. From 1993 to 2013, he was a full professor of the Graduate School of Engineering, Hiroshima University.

Prof. Morita has been engaged in the research of automata theory, cellular automata, formal language theory, and reversible computing. He started the study of reversible computing in the mid-1980s. Since then, he studied many kinds of reversible computing models such as reversible Turing machines, reversible counter machines, reversible cellular automata, reversible logic elements, and others. In particular, he investigated the problem of how simple computationally universal reversible systems can be from the standpoint of automata theory. He proposed the framework of partitioned cellular automata for designing reversible cellular automata. Using this framework, he proved that a one-dimensional reversible cellular automaton is computationally universal. He also proposed reversible logic elements with memory as alternatives to reversible logic gates, and clarified their universality and usefulness.


Shin-ichi Minato:‪ Decision Diagrams and Reversible Computation

Shin-ichi Minato is a Professor at Graduate School of Informatics, Kyoto University. He received the B.E., M.E., and D.E. degrees from Kyoto University in 1988, 1990, and 1995, respectively. He worked for NTT Laboratories from 1990 until 2004. He was a Visiting Scholar at Stanford University in 1997. He joined Hokkaido University as an Associate Professor in 2004, and had been a Professor since 2010. From 2018, he is a Professor at Kyoto University (present position).

Prof. Minato's research interests include efficient representations and manipulation algorithms for large-scale discrete structures, such as Boolean functions, sets of combinations, sequences, permutations, etc. He proposed the data structure "ZDD," which is minutely written as an independent topic in the Knuth's book. From 2020, he started a nation-wide research project "AFSA: Algorithmic Foundations for Social Advancement" as the project leader. He is a senior member of IEEE, IPSJ and IEICE, and is a member of JSAI, and JSCS.


Atsushi Matsuo: TBA

(IBM Research - Tokyo)

Important dates:

Abstract submission:
March 14, 2021 (EXTENDED)

Submission deadline:
March 21, 2021 (EXTENDED)

Notification to authors:
April 24, 2021

Final version:
May 12, 2021

July 7 - July 8, 2021

General Chair:

Shoji Yuen
Nagoya University, Japan

Program Chairs:

Shigeru Yamashita
Ritsumeikan University, Japan

Tetsuo Yokoyama
Nanzan University, Japan