edited by
521 views
0 votes
0 votes
$\sum$ = $\left \{ a,b \right \}$

All strings with at least 1 a and exactly 2 b's.
edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
1
dd asked Dec 12, 2016
776 views
$\sum = \left \{ a,b \right \}$ All strings with exactly two a's and more than one b.I did in the following way :Please verify if further minimization possible.Or any oth...
5 votes
5 votes
6 answers
2
dd asked Sep 24, 2016
2,988 views
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$Minimal DFA for the above language ?
1 votes
1 votes
1 answer
3
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?