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 dif...
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on fin...
: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
Abstract— In this paper, we integrate the traditional finitestate automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrat...