PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Morita, Kenichi"

Author of the publication

copydeleteadd this publication to your clipboard
Universality Problems on Reversible Logic Elements with 1-Bit Memory.

, , and . IJUC, 10 (5-6): 353-373 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Morita, Kenichi
add a person with the name Morita, Kenichi
 

Other publications of authors with the same name

Pattern Generation and Parsing by Array Grammars., , and . Formal Models, Languages and Applications, volume 66 of Series in Machine Perception and Artificial Intelligence, page 260-273. World Scientific, (2007)Finding the Minimum Number of Face Guards is NP-Hard., , and . IEICE Transactions, 95-D (11): 2716-2719 (2012)Generalized Chat Noir is PSPACE-Complete., , , and . IEICE Transactions, 96-D (3): 502-505 (2013)Computing by Swarm Networks., , , , , , , and . ACRI, volume 5191 of Lecture Notes in Computer Science, page 50-59. Springer, (2008)Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata.. ACRI, volume 9863 of Lecture Notes in Computer Science, page 45-54. Springer, (2016)A computation-universal two-dimensional 8-state triangular reversible cellular automaton., and . Theor. Comput. Sci., 231 (2): 181-191 (2000)Reversible computing and cellular automata - A survey.. Theor. Comput. Sci., 395 (1): 101-131 (2008)General design of reversible sequential machines based on reversible logic elements., , and . Theor. Comput. Sci., (2015)Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs., , , , and . Acta Inf., 44 (5): 345-359 (2007)Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars., , and . Theor. Comput. Sci., 304 (1-3): 185-200 (2003)