The Behavior of L-graph Automata

This paper first introduces the L-graph automaton built on an L-graph using a zero-constraint set. Then, we study the behavior of the corresponding automaton when the L-graph is a path L-graph (cycle, complete, fully bipartite). These L-graph automata have some applications in various fields. One of them is the identification of drugs that have the most similar side effects. These concepts and applications have been illustrated with some examples.