Scribd Logo
Upload

Welcome to Scribd!

  • Assignment 4

    Uploaded by

    P o o P o o H e a d
    33 views1 page
    This document contains instructions for Assignment 4 of the course CSI3104 - Introduction to Formal Languages. It asks students to design two Turing machines: one that accepts strings over the alphabet {a,b} whose length is a multiple of 4, and another that accepts strings over the same alphabet with an equal number of a's and b's. For each Turing machine, students are instructed to explain the algorithm and states in English, draw the transition graph, and provide the transition instructions.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains instructions for Assignment 4 of the course CSI3104 - Introduction to Formal Languages. It asks students to design two Turing machines: one that accepts strings over the alphabet {a,b} whose length is a multiple of 4, and another that accepts strings over the same alphabet with an equal number of a's and b's. For each Turing machine, students are instructed to explain the algorithm and states in English, draw the transition graph, and provide the transition instructions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    33 views1 page

    Assignment 4

    Uploaded by

    P o o P o o H e a d
    This document contains instructions for Assignment 4 of the course CSI3104 - Introduction to Formal Languages. It asks students to design two Turing machines: one that accepts strings over the alphabet {a,b} whose length is a multiple of 4, and another that accepts strings over the same alphabet with an equal number of a's and b's. For each Turing machine, students are instructed to explain the algorithm and states in English, draw the transition graph, and provide the transition instructions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    CSI3104 – Introduction to Formal Languages

    Assignment 4
    Q0

    Write your name and student number.

    Q1 of 2
    Construct Turing Machines

    Design Turing Machines for the following languages:


    The Turing Machines of this question don’t have an accept state or a reject state, instead, they
    have a final state. Start your solution by explaining the algorithm and states of the Turing
    machine (in English). Draw the transition graph and write the transition instructions for each
    TM.

    (Q1-a) Let Σ = {a, b}. Build a TM for the language L = {w ∶ ∣w∣ is a multiple of 4}. |w| is the
    length of the string w, for example, |abab| = 4 or |bbbbaaaa| = 8

    (Q1-b) Let Σ = {a, b}. Build a TM for the language that accepts all words with equal number of
    a’s and b’s.

    Q2 of 2

    Did you answer Question 0?

    You might also like