Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS402 Theory of Automata Assignment No 01 Solution & Discussion Due Date: 23-11-2015

CS402 Theory of Automata Assignment No 01 Solution & Discussion Due Date: 23-11-2015

Write regular expressions for the following languages over the alphabet ∑ = {0, 1}:

 Question 1;

  1. Language of all strings which do not end with 11.
  2. Language of all strings which do not contain the substring 01. 

Question 2;

Draw Finite Automaton for each of the above described languages.

Views: 13691

Replies to This Discussion

i will try to post corrct one for question one.
please check my replies for solution of question two

Cs402 solution

Attachments:

aoa s k bary main confirm hai

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

in ki diagrams b bnani hain keya ?

2nd qstn main to help kr den

if some one has objection please reply so that we come to some conclutions

Attachments:

please check solution to question 2 and object

Attachments:

ye 2 nd walay ka jawab hai k nai....?

RSS

Looking For Something? Search Below

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

------------------------------------

Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service