Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    19cse214: Theory of Computation: Case Study Report

    Uploaded by

    Harish R
    The document describes an automaton for an ATM machine. It includes: 1. States for the various stages of a transaction like card read, authentication, deposit, withdraw, transfer, complete, and trap state. 2. Tokens/inputs representing actions like insert card, enter PIN, select deposit/withdraw/transfer, enter amounts, abort, or start new transaction. 3. A pushdown automaton specification with the states, inputs, transitions, and accepting/trap states to model the ATM's behavior.

    Copyright:

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

    19cse214: Theory of Computation: Case Study Report

    Uploaded by

    Harish R
    38 views5 pages
    The document describes an automaton for an ATM machine. It includes: 1. States for the various stages of a transaction like card read, authentication, deposit, withdraw, transfer, complete, and trap state. 2. Tokens/inputs representing actions like insert card, enter PIN, select deposit/withdraw/transfer, enter amounts, abort, or start new transaction. 3. A pushdown automaton specification with the states, inputs, transitions, and accepting/trap states to model the ATM's behavior.

    Original Title

    ATM Machine 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an automaton for an ATM machine. It includes: 1. States for the various stages of a transaction like card read, authentication, deposit, withdraw, transfer, complete, and trap state. 2. Tokens/inputs representing actions like insert card, enter PIN, select deposit/withdraw/transfer, enter amounts, abort, or start new transaction. 3. A pushdown automaton specification with the states, inputs, transitions, and accepting/trap states to model the ATM's behavior.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    38 views5 pages

    19cse214: Theory of Computation: Case Study Report

    Uploaded by

    Harish R
    The document describes an automaton for an ATM machine. It includes: 1. States for the various stages of a transaction like card read, authentication, deposit, withdraw, transfer, complete, and trap state. 2. Tokens/inputs representing actions like insert card, enter PIN, select deposit/withdraw/transfer, enter amounts, abort, or start new transaction. 3. A pushdown automaton specification with the states, inputs, transitions, and accepting/trap states to model the ATM's behavior.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    19CSE214 : THEORY OF

    COMPUTATION

    CASE STUDY REPORT

    ATM MACHINE

    TEAM MEMBERS :

    DEEPAK L [CB.EN.U4CSE19418]
    KARAN M [CB.EN.U4CSE19428]
    NANDA KISHORE B [CB.EN.U4CSE19442]
    SURAJ S P [CB.EN.U4CSE19457]
    19CSE214 : Theory Of Computation
    Case study report

    PROBLEM STATEMENT:

    The objective of this project is to design a simple automaton for an ATM, with the
    various possible operations it can support.

    USE CASE DESCRIPTION:

    1. First the ATM is in welcome state


    2. Then the user inserts the card, and the card is read
    3. The user then can perform one of the possible operations
    a) deposit cash
    b) withdraw cash
    c) transfer money
    d) view account statements
    e) check balance
    4. After performing one transaction, the user can proceed to one more transaction if
    he wishes
    5. If in between some error occurs in between, the automata goes to trap state

    https://image.slidesharecdn.com/automatictellermachine-151125142040-lva1-app6892/95/auto-
    matic-teller-machine-1-1024.jpg?cb=1448461265
    SPECIFICATION OF TOKENS:
    I - insert card
    P - pin
    D - deposit cash
    W - withdraw cash
    B - check balance
    T - transfer
    V - view account statements
    0-9 - pin , account no , cash
    A - Abort transaction
    N - new transaction

    STATES USED:
    I0 - welcome state
    I1 - card read state
    I2 - authentication completed state
    I3 - deposit cash state
    I4 - withdraw cash state
    I5 - send money state
    I6 - transaction complete state
    I7 - prompt accountNo state
    I8 - print account state
    TS - trap state
    F - remove card

    PUSH DOWN AUTOMATA:

    V = { I0 , I1 , I2 , I3 , I4 , I5 , I6 , I7 , I8 , TS , F }
    Σ = { I , P , D , V , W , T , 0-9 , N , A }
    q0 = { I0 }
    F={F}
    δ={
    { I0 , I , λ } = { I1 , c }
    { I1 , P , c } = { I2 , b }
    { I2 , D , b } = { I3 , n }
    { I2 , V , b } = { I8 , λ }
    { I2 , W , b } = { I4 , n }
    { I2 , T , b } = { I5 , n }
    { I3 , 0-9 , n } = { I6 , λ }
    { I4 , 0-9 , n } = { I6 , λ }
    { I5 , 0-9 , n } = { I7 , a }
    { I6 , N , λ } = { I2 , b }
    { I7 , 0-9 , a } = { I6 , λ }
    { I8 , N , λ } = { I2 , b }
    { I1 , λ , c } = { TS , λ }
    { I2 , λ , b } = { TS , λ }
    { I3 , λ , n } = { TS , λ }
    { I4 , λ , n } = { TS , λ }
    { I5 , λ , n } = { TS , λ }
    { I7 , λ , a } = { TS , λ }
    { I1 , A , c } = { F , λ }
    { I2 , A , b } = { F , λ }
    { I3 , A , n } = { F , λ }
    { I4 , A , n } = { F , λ }
    { I5 , A , n } = { F , λ }
    { I6 , λ , n } = { F , λ }
    { I7 , A , a } = { F , λ }
    { I8 , λ , λ } = { F , λ }
    }

    You might also like