Scribd Logo
Upload

Welcome to Scribd!

  • Automata Project Proposal Milestone 1

    Uploaded by

    Muhammad Adnan Khalid
    53 views1 page
    This document contains a project proposal for designing a deterministic finite automaton (DFA) that accepts strings starting and ending with the same character from the input set {a, b}. It provides background on DFAs, stating they are finite state machines that accept a string if it reaches a final state. It notes DFAs have no memory, so the string must be checked character by character from the 0th character. The functional feature is given a string of a's and b's, the DFA will print "Yes" if it starts and ends with the same character, and "No" otherwise. It will first build the DFA machine as a flowchart with states and transitions to solve this problem.

    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 a project proposal for designing a deterministic finite automaton (DFA) that accepts strings starting and ending with the same character from the input set {a, b}. It provides background on DFAs, stating they are finite state machines that accept a string if it reaches a final state. It notes DFAs have no memory, so the string must be checked character by character from the 0th character. The functional feature is given a string of a's and b's, the DFA will print "Yes" if it starts and ends with the same character, and "No" otherwise. It will first build the DFA machine as a flowchart with states and transitions to solve this problem.

    Copyright:

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

    Automata Project Proposal Milestone 1

    Uploaded by

    Muhammad Adnan Khalid
    This document contains a project proposal for designing a deterministic finite automaton (DFA) that accepts strings starting and ending with the same character from the input set {a, b}. It provides background on DFAs, stating they are finite state machines that accept a string if it reaches a final state. It notes DFAs have no memory, so the string must be checked character by character from the 0th character. The functional feature is given a string of a's and b's, the DFA will print "Yes" if it starts and ends with the same character, and "No" otherwise. It will first build the DFA machine as a flowchart with states and transitions to solve this problem.

    Copyright:

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

    PAF-Karachi Institute of Economics & Technology

    Department of Computer Science


    Automata Theory Project Proposal Form

    Sno. Stud. ID Names Course Name


    1 9777 Muhammad Adnan Khalid Automata Theory

    2 9937 Safdar Avd

    Problem Statement: Design a deterministic finite automata (DFA) for


    accepting the language

    Introduction:
    DFA or Deterministic Finite Automata is a finite state machine which accepts a
    string(under some specific condition) if it reaches a final state, otherwise rejects it.

    In DFA, there is no concept of memory, therefore we have to check the string


    character by character, beginning with the 0th character. The input set of
    characters for the problem is {a, b}. For a DFA to be valid, there must a transition
    rule defined for each symbol of the input set at every state to a valid state.

    Functional Feature:
    Given a string consisting of characters a and b, check if the string starts and
    ends with the same character or not. If it does, print ‘Yes’ else print ‘No’.

    For the above problem statement, we must first build a DFA machine. DFA
    machine is similar to a flowchart with various states and transitions.

    Language: Python
    IDE/Notebook : Jupyter Notebook

    Date: 9th March, 2021

    You might also like