Cellular Automata

Home > Languages > Formal Language > Finite Automata > Cellular Automata

It is a type of finite automata in which the grid of cells is used, and each cell follows predefined rules to change its state.