Scribd Logo
Upload

Welcome to Scribd!

  • Department: CSE/IT Name of The Faculty Member: Gunit Kaur Course Code: CSE321 Course Title: Automata Theory

    Uploaded by

    Pawan Singh
    7 views1 page
    This document contains a home work assignment from Lovely Professional University for the course Automata Theory. The assignment consists of 6 questions divided into two parts. Part A includes questions about defining pushdown automata and their moves, Kuroda normal form, and representing Turing machines with examples. Part B asks the student to design a Turing machine to add two unary numbers, differentiate between context-sensitive and one-sided context-sensitive grammars with examples, and describe the parsing algorithm for syntax analysis. The assignment is due on April 20th, 2011 for the class C1804 taught by faculty member Gunit Kaur with a maximum of 7 marks.

    Original Description:

    Original Title

    15429_C1804 HW4

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a home work assignment from Lovely Professional University for the course Automata Theory. The assignment consists of 6 questions divided into two parts. Part A includes questions about defining pushdown automata and their moves, Kuroda normal form, and representing Turing machines with examples. Part B asks the student to design a Turing machine to add two unary numbers, differentiate between context-sensitive and one-sided context-sensitive grammars with examples, and describe the parsing algorithm for syntax analysis. The assignment is due on April 20th, 2011 for the class C1804 taught by faculty member Gunit Kaur with a maximum of 7 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views1 page

    Department: CSE/IT Name of The Faculty Member: Gunit Kaur Course Code: CSE321 Course Title: Automata Theory

    Uploaded by

    Pawan Singh
    This document contains a home work assignment from Lovely Professional University for the course Automata Theory. The assignment consists of 6 questions divided into two parts. Part A includes questions about defining pushdown automata and their moves, Kuroda normal form, and representing Turing machines with examples. Part B asks the student to design a Turing machine to add two unary numbers, differentiate between context-sensitive and one-sided context-sensitive grammars with examples, and describe the parsing algorithm for syntax analysis. The assignment is due on April 20th, 2011 for the class C1804 taught by faculty member Gunit Kaur with a maximum of 7 marks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    LOVELY PROFESSIONAL UNIVERSITY

    HOME WORK: #4

    School: LST Department: CSE/IT

    Name of the faculty member: Gunit Kaur Course Code: CSE321

    Course Title: Automata Theory

    Class: C1804

    Max. Marks: 07 Date of Allotment: 13/04/11 Date of Submission: 20/04/11

    Part-A

    Q1. Define Pushdown Automata (PDA). Give the explanation for the moves of Pushdown
    Automata.

    Q2. Define Kuroda Normal Form. What is the significance of One-Sided Context sensitive
    Grammar.
    Q3. Give the representation of Turing machine with the help of examples.

    Part-B

    Q4. Design TM which performs addition of two unary numbers.

    Q5. Differentiate between Context-Sensitive and One-Sided context sensitive grammars giving
    examples.

    Q6. Describe the Parsing algorithm in Syntax Analysis

    You might also like