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: 13696

Replies to This Discussion

Sir Tariq bahi is this final solution?? We can trust this one??????

plz koi to btai k corect konsa solution ha.do not end with 11 is ka kea mtlb ha 11 .aur corect language line ks trha si hogi ^ OR e kea ai ga.

null use kr lain e ki bjy
chk this fa
Attachments:
enjoy first question Fa and reguler expression
Attachments:
null use kr ly best ha e ki bjay

Attachments:

RSS

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

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