This question is in regards to automata and computability and theory of computation. Originally I was asked the following: e a b c -+p {Q:r} 0 {Aq} *7' 0 0 0 0 a) Compute the epsilon-closure of each state. I found this to be: P rightarrow (P. Q. r} q rightarrow {q} rrightarrow{r} But now I'm asked something related to:^delta (p, c) +^delta (q, b) +^delta(r, c) where^delta = delta head I don't know what to make of this and I need help