Q no: 2
Build a DFA for the following language:
L = {w | w is a binary string that must contains 01 as a substring}
Q no: 3
Build a DFA for the language having Null only ?
Q no: 4
Build a DFA for the language having Everything ?
Q no: 5
Build a DFA for the language that accepts nothing i.e. empty Language?
Q no: 6
Build a DFA for the language having Null and 01 as a substring?
Q no: 7
Build a DFA for the following language:
L = { w | w is a binary string that has even number of 0s } ( note: 1’s can be zero to many)
Q no: 8
Build a DFA for the following language:
L = { w | w is a binary string that has even number of 1s only}
(Note: because it mention only there will be no zero at all)
Q no: 9
Build a DFA for the following language:
L = { w | w is a binary string that has even number of 1s OR even number of 0s}
Q no: 10
Build a DFA for the following language:
L = { w | w is a binary string that has even number of 1s AND even number of 0s}
e.g. build for string 1100 and for 1001
For solution:
contact +923325198690
price Rs. 2000 0r $20 only
No comments:
Post a Comment