Scribd Logo
Upload

Welcome to Scribd!

  • Assignment 1

    Uploaded by

    Imtiyaz Hussain
    4 views2 pages
    The document defines a finite state machine (FSM) with states q0, q1, q2, and q3 to accept strings consisting of the letters 'a' and 'b'. The FSM transitions between states depending on the current input letter. It records the state transitions, runs the input string through the FSM, and prints whether the string is accepted or not along with the state transition trace.

    Original Description:

    Original Title

    ASSIGNMENT 1

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines a finite state machine (FSM) with states q0, q1, q2, and q3 to accept strings consisting of the letters 'a' and 'b'. The FSM transitions between states depending on the current input letter. It records the state transitions, runs the input string through the FSM, and prints whether the string is accepted or not along with the state transition trace.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    4 views2 pages

    Assignment 1

    Uploaded by

    Imtiyaz Hussain
    The document defines a finite state machine (FSM) with states q0, q1, q2, and q3 to accept strings consisting of the letters 'a' and 'b'. The FSM transitions between states depending on the current input letter. It records the state transitions, runs the input string through the FSM, and prints whether the string is accepted or not along with the state transition trace.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    Humza Alam

    2020-310-080

    ASSIGNMENT 1

    state_transition = []

    def q0(s,i):
        state_transition.append('q0')
        if (len(s)==i):
            return False

        if s[i] == 'a':
           return q1(s,i+1)
        else:
            return q3(s,i+1)

    def q1(s,i):
        state_transition.append('q1')
        if len(s) == i:
            return False

        if s[i] == 'a' or s[i] == 'b':


            return q2(s,i+1)

    def q2(s,i):
        state_transition.append('q2')
        if len(s) == i:
            return True

        if s[i] == 'a' or s[i] == 'b':


            return q2(s,i+1)

    def q3(s,i):
        state_transition.append('q3')
        if len(s) == i:
            return False

        if s[i] == 'a' or s[i]  == 'b':


            return q3(s,i+1)
       
    s = input("Enter string consistiong{a,b}: ")
    ans = q0(s,0)
    if ans:
        print("String Accepted")
    Humza Alam
    2020-310-080

       
        for i in state_transition:
            print(i, end = " ")
       
    else:
        print("String Not Accepted")

    Output:

    You might also like