The following pages link to Katsunobu Imai (Q235714):
Displaying 44 items.
- Fluctuation-driven computing on number-conserving cellular automata (Q454911) (← links)
- Firing squad synchronization problem in reversible cellular automata (Q671532) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Self-reproduction in a reversible cellular space (Q1349866) (← links)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- A quadratic speedup theorem for iterative arrays (Q1403336) (← links)
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton (Q1575918) (← links)
- Corona limits of tilings: periodic case (Q1731461) (← links)
- Uniquely parsable unification grammars and their parser implemented in Prolog (Q1841065) (← links)
- (Q2743826) (← links)
- Number-Conserving Reversible Cellular Automata and Their Computation-Universality (Q2773021) (← links)
- Advances on Random Sequence Generation by Uniform Cellular Automata (Q2944879) (← links)
- On DNA-Based Gellular Automata (Q2945537) (← links)
- The Corona Limit of Penrose Tilings Is a Regular Decagon (Q3186471) (← links)
- A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata (Q3541772) (← links)
- On Universality of Radius 1/2 Number-Conserving Cellular Automata (Q3575217) (← links)
- (Q3605710) (← links)
- (Q4437094) (← links)
- (Q4505365) (← links)
- (Q4505366) (← links)
- (Q4505368) (← links)
- (Q4530003) (← links)
- (Q4544350) (← links)
- (Q4548320) (← links)
- (Q4548333) (← links)
- (Q4703863) (← links)
- (Q4708585) (← links)
- (Q4799368) (← links)
- (Q4825677) (← links)
- A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes (Q4917110) (← links)
- (Q4934340) (← links)
- (Q4937227) (← links)
- (Q4937868) (← links)
- Universality of Reversible Hexagonal Cellular Automata (Q4953340) (← links)
- (Q4986323) (← links)
- On Radius 1 Nontrivial Reversible and Number-Conserving Cellular Automata (Q5112175) (← links)
- On the Persistency of Gellular Automata (Q5112181) (← links)
- A Time Hierarchy Theorem for Nondeterministic Cellular Automata (Q5425463) (← links)
- (Q5446715) (← links)
- Fundamentals of Computation Theory (Q5492923) (← links)
- 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal (Q5501611) (← links)
- Machines, Computations, and Universality (Q5710880) (← links)
- (Q5747096) (← links)
- Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)
