What kind of language does the following DFA accept? can anyone please describe the language this FA accepts? thank you
It accept all the words containing $i$ "a"s and $j$ "b"s for which $i \equiv j \pmod{4}$.