In this project a number is converted into a binary numeral creating a binary counter and following a non-recursive cellular automaton approach with the following rules:
- The state of the top cell (least significant bit) of the automaton (binary numeral) changes every new generation (number).
- The state of the other cells only change if the state of all the cells above are equal to 1.
- When the state of the bottom cell (most significant bit) changes from 1 to 0, a new cell with a state of 1 is created below.
The input "enable" is actually the first cell of the automaton, enabling (disabling) its evolution when the state of this cell is 1 (0). This cell is not visible.