2
$\begingroup$

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}.

$\endgroup$
1
$\begingroup$

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} \} $$

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.