cs402 today paper 20-12-2013
Q 1:consider alphabet is (0,1) you head to write a regular expession of the language having string that contains either 111 or 11 and have no more 1's.
Q 2: write at least one similarty and one difference between DFA &NFA.
Q 4: Write the RE of the given languages.
aur ak question tha k FA1 and FA2 ko NFA ma convert kry
aur ak FA ki transition table bnana tha (theorem part 111)
Best of luck
No comments:
Post a Comment
Please give us your feedback & help us to improve this site.