Register

number of dfa

736 views
0 votes
0 votes

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

436
views
1 answers
0 votes
Hritik1204 asked Jan 5
436 views
Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______
User Avatar
283
views
2 answers
0 votes
rohankrishan asked Jun 29, 2022
283 views
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
User Avatar
1.5k
views
0 answers
0 votes
koushriek asked May 19, 2022
1,467 views
Number of states in a DFA that accepts the language over the alphabet{0,1} where words start and end with a '1', have even length and where any 0 in the word is immediately followed by at least a 1.
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am I correct or where am I going wrong?My solution:
User Avatar
483
views
1 answers
0 votes
Rather.jamsheed asked Aug 19, 2018
483 views
draw dfa on w such that number of a in w mod 3 less than number of b in w mod 3
draw dfa on w number of a in w mod 3 less than number of b in w mod 3
User Avatar
Link Copied!