finite automata - I can construct DFA for $a^{3n+1}$ but pumping lemma says it is not regular - Computer Science Stack Exchange
Pumping Lemma in Theory of Computation - GeeksforGeeks
SOLVED: (20 points) Pumping Lemma Consider the following automata where 2 = ,b,ede. 0-0 points) Yes No: Does this automata recognize regular langauage? points) Name string" that are this language: (8 points)