21 citations · 25 across the 4 of their papers we have counts for
Showing nlin.CGShow all
3 papers · 1 filter
nlin.CG2002★ 4 cited
Modulo Three Problem With A Cellular Automaton Solution
Hao Xu, K. M. Lee, H. F. Chau
An important global property of a bit string is the number of ones in it. It has been found that the parity (odd or even) of this number can be found by a sequence of deterministic…
nlin.CG2001
Finding The Sign Of A Function Value By Binary Cellular Automaton
H. F. Chau, H. Xu, K. M. Lee +2
Given a continuous function , suppose that the sign of only has finitely many discontinuous points in the interval . We show how to use a sequence of one dimension…
nlin.CG2001★ 21 cited
Parity Problem With A Cellular Automaton Solution
K. M. Lee, Hao Xu, H. F. Chau
The parity of a bit string of length is a global quantity that can be efficiently compute using a global counter in time. But is it possible to find the parity using…