Register

Toc_dfa

306 views
0 votes
0 votes
In how many ways we can minimize DFA ? Please share some quick method to minimize DFA.
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

60
views
0 answers
0 votes
Ramkrishna Sahu asked Jun 17
60 views
DFA construction
construct a minimal DFA for the regular language L= {W | w contain 'a' in every odd position, w∈{a,b}* }
User Avatar
45
views
0 answers
0 votes
imp-joshi asked Jun 17
45 views
DFA
Identify language accepted by following dfa. A. L = {a^n b^m | n,m >= 1} B. L = {a^n b^m | n >= 1, m >= 0} C. L = {a^n b^m | n,m >= 0} D. None
User Avatar
128
views
1 answers
2 votes
srijanguptaa asked Jun 2
128 views
#TOC-regular-language
Captioncreate a DFA for language L={a^n b^m | n=(m%3) } 
User Avatar
207
views
1 answers
0 votes
mr_nikhil_mishra asked May 30
207 views
TOC
Number of states in a DFA that accepts string over the alphabet {0,1} where words start and end with a 1, have even length and every 0 is immediately followed by atleast a 1.
User Avatar
Link Copied!