Register

To make a DFA

389 views
2 votes
2 votes
make a DFA having alphabet set {0,1} means that accept binary strings that start with  ' 10 ' and congruent to  ' 2 mod 3 '.
User Avatar

2 Answers

1 votes
1 votes
Ans should be 6..

For "10" + 1 dead state + 2mod 3

= 2 + 1 + 3 =6
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
2 answers
1
dragonball asked Oct 26, 2017
733 views
How to make a minimal DFA
Draw a minimal DFA which accepts a language L over {a,b} 01 [ ((10) * + 111) * + 0 ] * 1
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
User Avatar
0 votes
0 votes
1 answer
2
radha gogia asked Nov 17, 2015
596 views
How to make a DFA given a regular grammar ?
A-->aB/bA/b , B-->aC/bB , C-->aA/bC/a what is the approach ?
A >aB/bA/b , B >aC/bB , C >aA/bC/awhat is the approach ?
User Avatar
0 votes
0 votes
1 answer
3
shivajikobardan asked Nov 1, 2021
2,536 views
DFA that accepts aaa or bbb as substring-: How to make?
https://i.stack.imgur.com/v70kK.jpg I have tried but it is wrong as it accepts abba. What is the correct dfa for this?
https://i.stack.imgur.com/v70kK.jpgI have tried but it is wrong as it accepts abba. What is the correct dfa for this?
User Avatar
0 votes
0 votes
2 answers
4
CSHuB asked Jan 24, 2019
559 views
#toc How to make DFA for this.
How to draw a DFA for the below language. $L$ = {$W | W \in$ $ (0, 1)^* $}; $W$ ends with 0 and contains the substring 100 } No. of states in minimal DFA.
How to draw a DFA for the below language.$L$ = {$W | W \in$ $ (0, 1)^* $};$W$ ends with 0 and contains the substring 100 }No. of states in minimal DFA.
User Avatar
Link Copied!