A deterministic finite automaton in which every non-empty set of states occurs as the image whole state under action a suitable input word is called completely reachable. We characterize such automata terms graphs and trees.

Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...