Yes it is regular ..The reason being we have equivalent regular expression for it..The regular expression for the given language is given by :
(a+ b* a+) * + (b+ a* b+)*
Hence we can have equivalent NFA and DFA also..
Thus the given langauge is regular
Does above regular expression include, L = ababba ??
I think, It should be - R(L) = ∈ + a( a* + b+a+ )* + b( b* + a+b+ )*.
I agree with u @vijaycs..
Actually my source was : http://www.cs.gordon.edu/courses/cps220/Notes/nonregular_languages
Ohh nice.. It should also accept jumbled character set also ?
@Habib, I think, The equiv. DFA is correct in your source ..please check it @Habib, @srestha ?
@ Habibkhan sir the regular expression given by you not accepts single a or single b.
which is also the part of language
plz check ......
See this one