The Kronecker Product Of Two L-graph Automata

The concept of the Kronecker product of two L-graph automata is introduced in this paper,with a clear explanation provided through an example. It is demonstrated that this operation is commutative,meaning that A(Z(G)) ? A(Z(H)) and A(H)) ? A(Z(G)) are equivalent. This paper also presentssome properties of this notion through the use of theorems.

Keywords:

L-graph , L-graph automaton , isomorphic L-graph , kronecker product of two L-graph automata , isomorphic L-graph automata.