Register

minimized dfa

388 views
1 votes
1 votes
Consider a language over Σ={a,b} such that each string has at most two a’s and at least two b’s. The number of states in minimized DFA and number of final states are respectively.
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

5 votes
5 votes
6 answers
2
dd asked Sep 24, 2016
3,156 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
1 answer
3
One asked Jul 22, 2016
838 views
Find the number of states required in the minimized DFA
Let L be the language over {a,b} and it contains all strings with following rules. 1. Every string starts with "a" 2. Every string contains "ab" 3. Every string ends with "b" Find the number of states required in the minimized DFA that accepts L.
Let L be the language over {a,b} and it contains all strings with following rules.1. Every string starts with "a"2. Every string contains "ab"3. Every string ends with "b...
User Avatar
2 votes
2 votes
1 answer
4
David asked Nov 1, 2015
1,022 views
If DFA is constructed from NFA using lazy subset construction method , is it guaranteed to be the minimized DFA ?
User Avatar
Link Copied!