Search Results - "Morita, Kenichi"

A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines.

Authors: Morita, Kenichi¹ km@hiroshima-u.ac.jp

Source: Computer Science Journal of Moldova. 2024, Vol. 32 Issue 3, p425-445. 21p.

This result is not displayed to guests.
Login for full access.

An instruction set for reversible Turing machines.

Authors: Morita, Kenichi¹, km@hiroshima-u.ac.jp

Source: Acta Informatica; Aug2021, Vol. 58 Issue 4, p377-396, 20p

A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior.

Authors: Morita, Kenichi¹, km@hiroshima-u.ac.jp

Source: Natural Computing; Sep2019, Vol. 18 Issue 3, p413-428, 16p

Reversible Marker Automata on Two-Dimensional Tapes.

Authors: MORITA, KENICHI¹, km@hiroshima-u.ac.jp

Source: International Journal of Unconventional Computing; 2019, Vol. 14 Issue 5/6, p413-447, 35p

Fredkin gates in simple reversible cellular automata.

Authors: Morita, Kenichi¹ (AUTHOR) km@hiroshima-u.ac.jp

Source: International Journal of Parallel, Emergent & Distributed Systems. May2022, Vol. 37 Issue 3, p249-272. 24p.

Subjects: Cellular automata, Cell compartmentation, Turing machines, Mathematical logic, Logic circuits, Reversible computing

This result is not displayed to guests.
Login for full access.

This result is not displayed to guests.
Login for full access.

Universal Reversible Turing Machines with a Small Number of Tape Symbols.

Authors: Morita, Kenichi¹, km@hiroshima-u.ac.jp

Source: Fundamenta Informaticae; 2015, Vol. 138 Issue 1-2, p17-29, 13p

Reversibility in space-bounded computation.

Authors: Morita, Kenichi¹, km@hiroshima-u.ac.jp

Source: International Journal of General Systems; Oct2014, Vol. 43 Issue 7, p697-712, 16p

Brownian Circuits: Fundamentals.

Authors: PEPER, FERDINAND JIA LEE CARMONA, JOSEP et al.

Source: ACM Journal on Emerging Technologies in Computing Systems; Feb2013, Vol. 9 Issue 1, p3:1-3:24, 24p

Computation in reversible cellular automata.

Authors: Morita, Kenichi¹, morita@iec.hiroshima-u.ac.jp

Source: International Journal of General Systems; Aug2012, Vol. 41 Issue 6, p569-581, 13p, 7 Diagrams

Sequential and maximally parallel multiset rewriting: reversibility and determinism.

Authors: Alhazov, Artiom Freund, Rudolf Morita, Kenichi

Source: Natural Computing; Mar2012, Vol. 11 Issue 1, p95-106, 12p

Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal.

Authors: MORITA, KENICHI OGIRO, TSUYOSHI ALHAZOV, ARTIOM et al.

Source: Journal of Multiple-Valued Logic & Soft Computing; 2012, Vol. 18 Issue 1, p37-54, 18p

Two-Way Reversible Multi-Head Finite Automata.

Authors: Morita, Kenichi¹

Source: Fundamenta Informaticae; 2011, Vol. 110 Issue 1-4, p241-254, 14p, 3 Diagrams

This result is not displayed to guests.
Login for full access.

Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.

Authors: Iwamoto, Chuzo Hatayama, Naoki Nakashiba, Yoshiaki et al.

Source: Acta Informatica; Sep2007, Vol. 44 Issue 5, p345-359, 15p

Simple Universal One-Dimensional Reversible Cellular Automata.

Authors: Morita, Kenichi¹ morita@iec.hiroshima-u.ac.jp

Source: Journal of Cellular Automata. 2007, Vol. 2 Issue 2, p159-165. 7p. 3 Diagrams, 1 Chart.

Firing Squad Synchronization Problem in Number-Conserving Cellular Automata.

Authors: Imai, Katsunobu Morita, Kenichi Sako, Kenji

Source: Fundamenta Informaticae. Sep2002, Vol. 52 Issue 1-3, p133. 9p. 1 Diagram, 3 Charts.

Subjects: Cellular automata, Parallel processing

Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces.

Authors: Lee, Jia Adachi, Susumu Peper, Ferdinand et al.

Source: Fundamenta Informaticae; Dec2003, Vol. 58 Issue 3-4, p295-320, 26p, 19 Diagrams, 7 Charts