I am trying to create a DFA that can recognize strings with alphabet $\{a,b,c\}$ where $a$ and $c$ appear even number of times and where $b$ appears odd number of times.
I am wondering that this may only be expressed with other methods such as Turing machine or context-free languages.
You might find it fun to think of the solution.