The Gateway to Computer Science Excellence
0 votes
19 views
Find a regular expression for the following languages on {$a, b$}.
(a) $L =$ {$w : n_a (w)$ and $n_b (w)$ are both even}.
(b) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 1$}.
(c) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 0$}.
(d) $L =$ {$w :2n_a (w)+3n_b (w)$ is even}.
in Theory of Computation by Boss (15.4k points) | 19 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,385 answers
198,557 comments
105,368 users