Sponsored Links

Results 1 to 1 of 1

Thread: CS402 Theory of Automata Mid Term paper spring 2011

  1. #1
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011

    Word Icon 35px Jpg.ashx CS402 Theory of Automata Mid Term paper spring 2011

    Sponsored Links1

    for solve look attachment

    CS402 Theory of Automata
    Mid Term Examination Spring 2006
    Question No. 1 Marks : 1
    If s=abcd is a string defined over . = {a,bc,d} then reverse of s is dcba.
    Question No. 2 Marks : 10
    Find the regular expression associated to the following FA. Show all steps.
    [Hint: use FA to GTG and GTG to RE.]
    Question No. 3 Marks : 1
    . = {aa, b}, length(aaaabaabb) = 5.
    Question No. 4 Marks : 1
    Every NFA can be converted into FA.
    Question No. 5 Marks : 1
    There can be more than one start states in TG.
    Question No. 6 Marks : 1
    A regular language can not be infinite.
    Question No. 7 Marks : 10
    a) Write the recursive definition of the following language. [6]
    L = Defining the language {a2n b4n }, n=1,2,3, , of strings defined over ={a, b}
    b) Write a regular expression of the language having strings that either start or end with
    00 and have no more zeroes. Where the alphabet is {0, 1}. [4]
    Question No. 8 Marks : 1
    Kleene star of {1} generates {1, 11, 111, 1111, 11111 }.
    Question No. 9 Marks : 10
    a) Define NFA-null. [4]
    b) Draw DFA for the following NFA. [6]
    Question No. 10 Marks : 1
    If a regular language is empty then we denote it like L = . (fi).
    Question No. 11 Marks : 1
    Recursive method for defining language is only for regular languages.
    Question No. 12 Marks : 1
    aa* = a+ ?
    Question No. 13 Marks : 1
    The language equal means number of as and bs are equal with null string.

    for solve look attachment

    Sponsored Links
    Attached Files Attached Files

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Replies: 5
    Last Post: 12-16-2012, 11:59 AM
  2. Replies: 3
    Last Post: 11-11-2011, 06:20 AM
  3. Replies: 0
    Last Post: 04-24-2011, 08:27 AM
  4. Replies: 0
    Last Post: 04-14-2011, 06:54 AM
  5. Replies: 0
    Last Post: 07-17-2010, 05:34 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
-: Vuhelp Disclaimer :-
None of the files shown here are hosted or transmitted by this server. The links are provided solely by this site's users. The administrator's or staff of Vuhelp.net cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms. If you have any doubts about legality of content or you have any suspicions, feel free to contact us.
Online Education | JhelumSoft