Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    ALC Prev - 2023

    Uploaded by

    crt9876543210
    Automata theory Computation

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    ALC Prev - 2023

    Uploaded by

    crt9876543210
    2 views2 pages
    Automata theory Computation

    Original Title

    ALC prev_2023

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Automata theory Computation

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2 views2 pages

    ALC Prev - 2023

    Uploaded by

    crt9876543210
    Automata theory Computation

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Code No: E- 5773/N/AICTE

    FACULTY OF ENGINEERING
    B.E (CSE) V. Semester (AICTE) (Main) (New) Examinations, February/ March 2023

    Subject: Automata Language and Computation


    Time: 3 Hours Max. Marks: 70
    Note: (i) First question is compulsory and answer any four questions from the
    remaining six questions. Each questions carries 14 Marks.
    (i) Answer to each question must be written at one place only and in the same
    order as they occur in the question paper.
    (ii) Missing data, if any, may be suitably assumed.
    1. a Define Regular expressions and construct a regular expression for the Set of all strings
    Over 2=(a,b} containing strings of length exactly two.
    Draw an E-NFA for the regular expression 01(0+11)" 01
    C) Construct a context-free grammar for even number of a's over
    2a.b}
    dDescribe Universal Turing Machine (UTM).
    P)Find the Epsilon closures of all the states in the below Automaton

    Write the closure and decision properties of CFLs


    9Define ID of Turing machine.

    Differentiate between NFA and DFA


    stert
    A

    i Construct an equivalent DFA for the above NFA.


    y Give applications of Finite automata.

    3. a) Construct a Pushdown Automata (PDA) to accept palindromes over = (a.b)


    b) Construct the leftmost derivation, rightmost derivation and parse trees for the following
    string "ibtibtaea" by using the given context free grammar
    G(V=[S.C), T={i.b,a,t.e). P, S)
    SiCtS | iCtSeS | aa Cb

    .2.
    Code No: E-5773/N/AICTE
    -2
    4.a) Convert the following Context free grammar into Chomsky Normal form after simplífying
    the grammar.
    G(V=(S.A,B,C.D), T={a.b}.P,S} is
    SaAa laBC AaS | bD |E BaBa C|b Cabb | DD D aDa
    b) State and Use pumping lemma to prove that the language L= {a" I p is a prime number
    is not a CFL.

    5. a) Design a Turing machine over = {a,b} to accept the language


    L={arb| n>0}. Check whetherthe string aabb is accepted by the Turing machine.
    b) Describe the various types and programming techniques of Turing machine.

    a Find the solution to the instance of Post Correspondence Problem given in the table.
    Xi Yi
    0 000
    01000 O1
    01

    byWrite a short notes on iUndecidability üyChomsky Hierarchy.

    aMinimize the following Deterministic Finite Automaton (DFA) and then draw the
    Minimized DFA transition diagram. Check whether the string 011 is Accepted by the
    Minimized DFA.

    State/Input
    1 q2 q3
    q2 q3
    q3 q4 q3
    q4 q3 q5
    *q5 q2 q5

    Initial state={q1} final states={q3,.q5)

    )Prove that the following Context free grammar is ambiguous or not.


    For the string "3 2+5"
    E-I
    EE+E
    E-E E
    E (E)
    E|0 1 121314|5|6|7|8|9

    You might also like