Register

DFA || Linz

819 views
2 votes
2 votes

$\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 other method ???

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
dd asked Dec 12, 2016
539 views
DFA || Linz 2.1 d
$\sum$ = $\left \{ a,b \right \}$ All strings with at least 1 a and exactly 2 b's.
$\sum$ = $\left \{ a,b \right \}$All strings with at least 1 a and exactly 2 b's.
User Avatar
5 votes
5 votes
6 answers
2
dd asked Sep 24, 2016
3,104 views
Minimized DFA no of states || Peter Linz
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$ Minimal DFA for the above language ?
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$Minimal DFA for the above language ?
User Avatar
0 votes
0 votes
0 answers
4
ankit-saha asked Mar 24, 2022
346 views
Minimal DFA
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
What will be the minimal DFA for $\left \{a^{n} :n mod 3 =0 \right \}\cup \left \{a^{n} :n mod 5 =1 \right \}$
User Avatar
Link Copied!