Question

OLIVA, ULTIULUI 13. Additional Problem 5-13 42 Figure 11

Answer 1

Does it accept the string ^ = Yes
Does it accept the string a = Yes
Does it accept the string b = Yes
Does it accept the string c = Yes
Does it accept the string aa = Yes
Does it accept the string ab = No
Does it accept the string bb = Yes
Does it accept the string bc = No
Does it accept the string cc = Yes
Does it accept the string aaa = Yes
Does it accept the string bbb = Yes
Does it accept the string ccc = Yes
Does it accept the string aab = No
Does it accept the string bbc = No
Does it accept the string cca = No
Does it accept the string abb = No
Does it accept the string bcc = No
Does it accept the string caa = No
Does it accept the string abc = No

the language of NFA is infinite
set = {^,a,aa,aaa,.........,b,bb,bbb,...........,c,cc,ccc,......}
regular expression = a* + b* + c*

Q = {q0, q1, q2, q3}
∑ = {a,b,c}
q = q0
F ={q1,q2,q3}
δ(q0,^) = {q1, q2, q3}
δ(q1,a) = {q1}
δ(q2,b) = {q2}
δ(q3,c) = {q3}