I am taking a course in the theory of computation and am trying to understand how to correctly design NFA's so that I can transform them into regex. I was wondering if I have Sigma={a,b} and need to design a NFA over Sigma Star that has at least one of its last 2 characters to be an 'a'; Can I simply start 2 threads, one that will accept 'a' as the last character and the other will accept 'a' or 'b' in the second to last position and 'a' as the last symbol? Also, the fact that this will be over Sigma Star, would that also mean that I have to have epsilon transitions included in this design?
Non-deterministic finite state automoton
finite automata;nondeterminism