Sponsored Links


Results 1 to 1 of 1

Thread: cs402 theory of automata final 1st assignment solution fall 2010

  1. #1
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,251

    Icon16 cs402 theory of automata final 1st assignment solution fall 2010

    Sponsored Links


    This solution can help you out just download it. have fun.

    Objectives
    Objective of this assignment is to make students able to understand the following concepts,
    Recursive Definition of a language
    Regular Expression
    Finite Automata

    Recursive Definition:
    Question No.1
    a. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings starting with a or
    b
    a. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings ending with aa.
    b. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings NOT ending
    with a.
    c. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings NOT ending
    with bb.
    d. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings having aa at any
    place.
    e. Give recursive definition of language defined over alphabet Σ = {a, b}, having all strings NOT having aa
    at any place.
    _______________________________

    Regular Expressions:
    Question No.2

    Give Regular Expression for each of the following language defined over alphabet Σ = {a, b}
    b. Language having all strings STARTING with a or b
    c. Language having all strings NOT having ab
    d. Language having all strings NOT having bb
    e. Language having all strings HAVING aa
    f. Language having all strings HAVING bba
    g. Language having all strings NOT having two consecutive as
    h. Language having all strings NOT having even no of as and bs
    ________________________________________

    Finite Automaton:
    Question No.3
    Give Finite Automata for each of the following language defined over alphabet Σ = {a, b}
    a. Language having all strings STARTING with a or b
    b. Language having all strings NOT having ab
    c. Language having all strings NOT having bb
    d. Language having all strings HAVING aa
    e. Language having all strings HAVING bba
    f. Language having all strings NOT having two consecutive as
    g. Language having all strings NOT having even no of as and bs

    _____________________________________

    RE to FA and FA to RE conversion:
    Question No.4

    Convert FAs of the following two languages you have already made in Question No.3 to REs using procedure
    given in Kleenes theorem and verify RE with your given RE in question 2.
    a. Language having all strings HAVING aa
    b. Language having all strings NOT having two consecutive as
    ___________________________

    Important Note:
    While attempting any question always remember the following points:
    o Where OR is used in the description of a language it means that expressions on both sides of OR are
    parts of the language.
    o Where NOT is used in description of the language it means that language includes all strings except
    described in the NOT condition, for example language NOT starting with a, means all strings not having
    a in the start (you have to evaluate yourself what kinds of strings are these).

    Solution can be found on the attachment file.

    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. CS402 Theory of Automata Assignment No.6 Solution Fall Semester 2013
    By Vuhelper in forum Assignments & Solutions
    Replies: 0
    Last Post: 02-09-2013, 03:46 PM
  2. Replies: 0
    Last Post: 01-24-2013, 04:47 PM
  3. Replies: 0
    Last Post: 08-16-2010, 06:15 AM
  4. CS402 Theory of Automata Assignment 3 solution May 21,2010
    By viki in forum Assignments & Solutions
    Replies: 0
    Last Post: 05-22-2010, 03:24 AM
  5. CS402 Theory of Automata Solution May 10,2010
    By viki in forum Assignments & Solutions
    Replies: 0
    Last Post: 05-11-2010, 06:07 AM

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