Searching for the solution, I have tried finding out the RE for odd number of a's as: b*ab*(ab*ab*)*.I also have tried playing with the RE of even-even language. Not to mention the RE of even / odd length language as well.After several hours of pondering and wondering, I'm still blank.Note that the answer is not available online anywhere.. Not even books or manuals are helpful.
What could be the RE of a language whose words have odd number of a's but even length, defined over {a,b}?
regular languages;automata;finite automata;regular expressions