Scribd Logo
Hochladen

Willkommen bei Scribd!

  • School of Information Technology & Engineering (SITE)

    Hochgeladen von

    Aditya Dev
    10 Ansichten1 Seite
    This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.

    Originalbeschreibung:

    soft_computing

    Originaltitel

    DA_2

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    10 Ansichten1 Seite

    School of Information Technology & Engineering (SITE)

    Hochgeladen von

    Aditya Dev
    This document provides instructions for an assignment involving theory of computation concepts. Students are asked to: 1) Convert the regular expression "aa(a+b)*bb(a+b)" into a non-deterministic finite automaton (NFA) using a JFLAP simulator. 2) Find the regular expression for a given NFA. 3) Convert the grammar rules "S → aXbX", "X → aY | bY | ∈", "Y→X|c" into Chomsky normal form.

    Copyright:

    © All Rights Reserved
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 1

    School of Information Technology & Engineering (SITE)

    Assignment Question – 2 (Winter 2017-18)

    Programme : B. Tech (IT) Slots : F1 + TF1 & F2 + TF2


    Course : ITE1006 - Theory of Computation Date : 24.02.2018

    Study the JFLAP Simulator.


    http://www.jflap.org/
    Use the simulator to do the following:

    1. Convert the given regular expression into NFA.


    aa(a+b)*bb(a+b)

    2. For the given NFA, find regular expression.

    3. Convert the given rules into Chomsky Normal Form. (∈ - Epsilon)


    S → aXbX
    X → aY | bY | ∈
    Y→X|c

    Das könnte Ihnen auch gefallen