Katsunobu Imai

According to our database1, Katsunobu Imai
  • authored at least 54 papers between 1996 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal.
CoRR, 2016

Particle Complexity of Universal Finite Number-Conserving Cellular Automata.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

The Corona Limit of Penrose Tilings Is a Regular Decagon.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2015
An Approach to Constructing and Simulating Block Cellular Automata by Gellular Automata.
Proceedings of the Third International Symposium on Computing and Networking, 2015

On Enumeration of Motion Representable Two-Dimensional Two-State Number-Conserving Cellular Automata.
Proceedings of the Third International Symposium on Computing and Networking, 2015

2014
On DNA-Based Gellular Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Embedding Game of Life into a Simple Asynchronous Cellular Automaton.
Proceedings of the Second International Symposium on Computing and Networking, 2014

On the Composition of Signals in Gellular Automata.
Proceedings of the Second International Symposium on Computing and Networking, 2014

Advances on Random Sequence Generation by Uniform Cellular Automata.
Proceedings of the Computing with New Resources, 2014

5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013
A Transferring Protocol using Local Information on Ad Hoc Sensor Network and Its Behaviors.
IJNC, 2013

A 6-state Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings.
Fundam. Inform., 2013

Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings.
Proceedings of the First International Symposium on Computing and Networking, 2013

Computing on a Simple Asynchronous Cellular Automaton.
Proceedings of the First International Symposium on Computing and Networking, 2013

2012
Fluctuation-driven computing on number-conserving cellular automata.
Inf. Sci., 2012

A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

Determining the Critical Temperature of the Continuous-State Game of Life.
Proceedings of the Cellular Automata, 2012

2011
A Transferring Protocol with Local Information on an Ad-Hoc Sensor Network.
Proceedings of the Second International Conference on Networking and Computing, 2011

2010
On Universality of Radius 1/2 Number-Conserving Cellular Automata.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

2009
A Characterization of von Neumann Neighbor Number-Conserving Cellular Automata.
J. Cellular Automata, 2009

On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four.
IEICE Transactions, 2009

2008
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Transactions, 2008

Simulations between triangular and hexagonal number-conserving cellular automata
CoRR, 2008

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata.
Proceedings of the Cellular Automata, 2008

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

A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
Proceedings of the Theory and Applications of Models of Computation, 2007

Pattern Generation and Parsing by Array Grammars.
Proceedings of the Formal Models, 2007

2006
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cellular Automata, 2006

2005
Translational Lemmas for Alternating TMs and PRAMs.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Transactions, 2004

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Transactions, 2004

Hierarchies of DLOGTIME-Uniform Circuits.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
Theor. Comput. Sci., 2003

Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Inform., 2003

2002
Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci., 2002

Firing Squad Synchronization Problem in Number-Conserving Cellular Automata.
Fundam. Inform., 2002

Self-Reproduction in Three-Dimensional Reversible Cellular Space.
Artificial Life, 2002

A quadratic speedup theorem for iterative arrays.
Acta Inf., 2002

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Computational Complexity in the Hyperbolic Plane.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Number-Conserving Reversible Cellular Automata and Their Computation-Universality.
ITA, 2001

A three-dimensional uniquely parsable array grammar that generates and parses cubes.
Electr. Notes Theor. Comput. Sci., 2001

Speeding-Up Cellular Automata by Alternations.
Proceedings of the Machines, 2001

2000
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Theor. Comput. Sci., 2000

Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog.
Grammars, 2000

1999
Uniquely parsable array grammars for generating and parsing connected patterns.
Pattern Recognition, 1999

Universality of Reversible Hexagonal Cellular Automata.
ITA, 1999

Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata.
IJPRAI, 1999

On Time-Constructible Functions in One-Dimensional Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1996
Self-Reproduction in a Reversible Cellular Space.
Theor. Comput. Sci., 1996

Firing Squad Synchronization Problem in Reversible Cellular Automata.
Theor. Comput. Sci., 1996

Logical Universality and Self-Reproduction in Reversible Cellular Automata.
Proceedings of the Evolvable Systems: From Biology to Hardware, 1996


  Loading...