Assignment number 2 1. What is a regular expression? exemplify. 2. Write a regular expression tenth symbol from the end is 1 (over{1, 0} ) fourth symbol from the beginning is 1 accepts a^2n b^2m+1 ,n>=0, m>=0 accepts at leat one a and at least one b over {1, b, c} accepts strings beinging with 1 and ending wit a 0. 3. Write an algorithm to convert regular expression to NFA. + question done in the class. 4. Define the following Alphabet String Laguage 5. What is a Melay machine? give example. 6. What is a Moore machine? Give example. 7. How will you convert a melay machine into a moore machine? + question done in the class( will be doing) 8. How will you convert a moore machine into a melay machine + question done in the class.( will be doing). 9. Differnce between a moore and melay machine.
Posted on: Sat, 31 Aug 2013 13:08:52 +0000
Trending Topics
Recently Viewed Topics
© 2015