 Since there is no state numbered higher than "n", the regular expression "R" represents the set of all strings that take "M" from its start state "q"0 to "q""j".If "F" = { "q"1...,"q""f" } is the set of accept states, the regular expression "R" | ... | "R" represents the language accepted by "M".The initial regular expressions, for "k" = -1, are computed as follows for "i"≠"j"