CS402 : Theory of Automata

CS402- Theory of Automata Assignment No. 03 Semester Fall 2016

This topic contains 0 replies, has 1 voice, and was last updated by  Googie.pk 5 days, 8 hours ago.

Viewing 1 post (of 1 total)
  • Author
    Posts
  • #6425

    Googie.pk
    Participant
    Points: 226

    Question No.01: (Marks 10)

    Let us consider the following languages Lx and Ly:

    Lx= Language of strings defined over Σ = {p, q}, ending with pp.
    Ly = Language of strings defined over Σ = {p, q}, ending with qq.

    You are required to draw a Transition Graph (TG) Corresponding to LxLy.

    Question No.02: (Marks 10)

    You are required to draw the corresponding Mealy Machine for the following table: consider q0 as initial state.

Viewing 1 post (of 1 total)

You must be logged in to reply to this topic.