Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    KCS402 CT1 2020 2021

    Uploaded by

    Underground Poetry
    This document contains a class test for a Theory of Automata and Formal Languages course. The test has two sections. Section A contains three short answer questions worth 2 marks each about designing deterministic finite automata (DFAs) for specific languages and converting an epsilon-nondeterministic finite automaton (ε-NFA) to a DFA. Section B contains three longer answer questions worth 3 marks each about minimizing a DFA, converting a Mealy machine to a Moore machine, and writing regular expressions for specified languages.

    Copyright:

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

    KCS402 CT1 2020 2021

    Uploaded by

    Underground Poetry
    17 views2 pages
    This document contains a class test for a Theory of Automata and Formal Languages course. The test has two sections. Section A contains three short answer questions worth 2 marks each about designing deterministic finite automata (DFAs) for specific languages and converting an epsilon-nondeterministic finite automaton (ε-NFA) to a DFA. Section B contains three longer answer questions worth 3 marks each about minimizing a DFA, converting a Mealy machine to a Moore machine, and writing regular expressions for specified languages.

    Original Title

    KCS402_CT1_2020_2021

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains a class test for a Theory of Automata and Formal Languages course. The test has two sections. Section A contains three short answer questions worth 2 marks each about designing deterministic finite automata (DFAs) for specific languages and converting an epsilon-nondeterministic finite automaton (ε-NFA) to a DFA. Section B contains three longer answer questions worth 3 marks each about minimizing a DFA, converting a Mealy machine to a Moore machine, and writing regular expressions for specified languages.

    Copyright:

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

    KCS402 CT1 2020 2021

    Uploaded by

    Underground Poetry
    This document contains a class test for a Theory of Automata and Formal Languages course. The test has two sections. Section A contains three short answer questions worth 2 marks each about designing deterministic finite automata (DFAs) for specific languages and converting an epsilon-nondeterministic finite automaton (ε-NFA) to a DFA. Section B contains three longer answer questions worth 3 marks each about minimizing a DFA, converting a Mealy machine to a Moore machine, and writing regular expressions for specified languages.

    Copyright:

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

    MORADABAD INSTITUTE OF TECHNOLOGY

    Department of Computer Science and Engineering


    Class Test – 1 (Semester - 4) Set-2
    Subject Name: Theory of Automata & Formal Languages MM:15
    Subject Code: KCS402 Session: 2020 – 2021 Duration: 60 min
    Q.No. 1 2 3 4 5 6
    CO 1 1 2 1 1 2
    Bloom’s Cognitive level Apply Apply Analyze Apply Apply Analyze

    Section(A)
    Attempt all questions. Each question carries 2 marks. (2*3 = 6)
    Q1. Design the DFA for following languages over the alphabet {a, b}.
    i. Language of all strings ends with either aab or bab in them.
    ii. Language of all strings containing even number of a’s and odd number of b’s.
    Q2. Convert the given ε-NFA into DFA

    Q3. Find the regular expression for the complement of the language recognized by the given NFA.

    Section(B)
    Attempt all questions. Each question carries 3 marks. (3*3=9)
    Q4. Minimize the following DFA having state q2 as final state:

    Present Next State


    State Input 0 Input 1
    →q0 q1 q5
    q1 q6 q2
    q2 q0 q2
    q3 q2 q6
    q4 q7 q5
    q5 q2 q6
    q6 q6 q4
    q7 q6 q2
    Q5. Convert the following Mealy machine to Moore Machine.

    Q6. Construct a regular expression for given languages over the alphabet {a, b}.
    i. Language of all words of length 3.
    ii. Language of all words starting with aa and ending with aa.
    iii. Language of all the strings that contains at least one a and at least one b.

    You might also like