Register

Minimal DFA

345 views
0 votes
0 votes
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

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
2 answers
1
aditi19 asked Dec 14, 2018
1,546 views
Minimal DFA
Given following NFA find the minimal equivalent DFA
Given following NFAfind the minimal equivalent DFA
User Avatar
1 votes
1 votes
1 answer
2
sripo asked Nov 6, 2018
3,028 views
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
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?
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?
User Avatar
0 votes
0 votes
0 answers
3
Harshitha 123 asked Jun 12, 2018
414 views
Minimal dfa
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
User Avatar
1 votes
1 votes
1 answer
4
kislaya Pant asked May 8, 2018
1,109 views
Minimal Final States in DFA
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
User Avatar
Link Copied!