21 citations · 39 across the 5 of their papers we have counts for
6 papers
Conditional traffic-like rules for particle-flow simulation in cellular automata
B. Wolnik, D. M. Falkiewicz, W. Bołt +2
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active…
Cellular automata can really solve the parity problem
Barbara Wolnik, Anna Nenca, Pedro Paulo Balbi +1
Determining properties of an arbitrary binary sequence is a challenging task if only local processing is allowed. Among these properties, the determination of the parity of 1s by d…
A split-and-perturb decomposition of number-conserving cellular automata
Barbara Wolnik, Anna Nenca, Jan M. Baetens +1
This paper concerns -dimensional cellular automata with the von Neumann neighborhood that conserve the sum of the states of all their cells. These automata, called number-conser…
Note on universal algorithms for learning theory
Karol Dziedziul, Barbara Wolnik
We propose the general way of study the universal estimator for the regression problem in learning theory considered in "Universal algorithms for learning theory Part I: piecewise…
The smoothness test for a density function
Bogdan Ćmiel, Karol Dziedziul, Barbara Wolnik
The problem of testing hypothesis that a density function has no more than derivatives versus it has more than derivatives is considered. For a solution, the norms of…
Number-conserving cellular automata with a von Neumann neighborhood of range one
Barbara Wolnik, Adam Dzedzej, Jan M. Baetens +1
We present necessary and sufficient conditions for a cellular automaton with a von Neumann neighborhood of range one to be number-conserving. The conditions are formulated for any…