H-kernels by walks in an RH(D) digraph

Let be a digraph possibly with loops and a digraph without loops whose arcs are colored with the vertices of ( is said to be an -colored digraph). A directed walk in is said to be an -walk if and o...