Register

What is the minimal DFA for this language (11+111)*, for Σ={0,1}.

3,051 views

1 Answer

Best answer
3 votes
3 votes

language accpted will be {£,11,111,1111,11111,......................} 

dfa will have 4 states 

For nfa remove the dead stage and correspondong edges

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
Anurag_s asked Aug 15, 2015
3,281 views
Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L
Let Σ= {a}, assume language, L= { a^(2012.K) / K 0}, what is minimum number of states needed in a DFA to recognize L
User Avatar
0 votes
0 votes
2 answers
2
iarnav asked Mar 14, 2019
934 views
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
User Avatar
4 votes
4 votes
3 answers
3
Vikrant Singh asked Jan 25, 2015
3,277 views
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?A. 8B. 9C. 6D. None
User Avatar
Link Copied!