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

Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.


1st qusetion ka ans

me right or not 

0+ 1 + (0+ 1)*(01+ 10 + 00)

no this is also not the right regular expresoin as its not acceting the Null string

this expression is correct. but u should have to include null string in it.

can we write ^ + 0+ 1 + (0+ 1)*(01+ 10 + 00)

can we wite the null (^) in requlaer expersion?

yes you can..this is right expression.

I think iss main 1 problem hay.

it cannot create the following sets



and so on

AOA, Brother, in my opinion it will accept all of these strings like this

take 00 OR 000 from (0+1)*
and append 01 from (01+10+00)

you will get 0001

null string ni

this is wrong solution for assignment 1 .please read language condition carefully, should not end with 11 and do not contain 01 both fa accepting string ending with the 11. it also contain 01 sub string. therefore it is totally wrong FA


Looking For Something? Search Below

Top Trends 

1 memon


Latest Activity

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

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