- #1
flying2000
- 40
- 0
Is that possible using six states to draw a NFSA(NFA) to represent a string ending with a symbol which occurred even times in this string(this string is consisted of only 0 and 1)..
I thought that the regular expression is (0*10*1)*(0*10*1) + (1*01*0)*(1*01*0), It can be easy using 7 states to draw a NFSA, but I can't figure out a way only using 6 states..
Any help wiill be appreciated!
I thought that the regular expression is (0*10*1)*(0*10*1) + (1*01*0)*(1*01*0), It can be easy using 7 states to draw a NFSA, but I can't figure out a way only using 6 states..
Any help wiill be appreciated!