The language that accepts strings with the number of 0s being congruent with 1%3 and an even number of 1s over the alphabet {0, 1}.
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
Here is one possible way: $$ \{ w \in \{0,1\}^* : \text{the number of 0s in $w$ is congruent to 1 modulo 3, and the number of 1s is even} \} $$
answered Oct 3, 2021 at 8:49