Please help me in this python code get me output of it and resolve error if posible i posted pictures of my question for your helpimport sysdef main():transition = [[[0,1],[0]], [[4],[2]], [[4],[3]], [[4],[4]]]input = raw_input("enter the string:")input = list(input) #copy the input in list because python strings are immutable and thus can't be changed directlyfor index in range(len(input)): #parse the string of a,b in 0,1 for simplicityif input[index]=='a':input[index]='0' else:input[index]='1'final = "3" #set of final states = {3}start = 0trans(transition, input, final, start)print ("rejected")def trans(transition, input, final, state):for each in transition[state][int(input[0])]: #check for each possibility if each < 4: #move further only if you are at non-hypothetical statestate = eachif len(input)==1:if (str(state) in final): #last symbol is read and current state lies in the set of final statesprint ("accepted")sys.exit()else:continuetrans(transition, input[1:], final, state) #input string for next transition is input[i+1:]main() 2. Write up an informal description of your chosen representation in a section of yourREADME, labeled DFA Data Representation.For example, here's mine in Racket:DFA Data Representation:A State is a stringA Symbol is a 1-char stringA DFA is a (struct states alpha delta start accepts)where:- states is a list of State- alpha is a list of Symbol- delta is a hash of State Symbol -> Symbol- start is a State- accept is a list of State-Note that structs, strings, lists, and hashes are data structures in my language. Yourdata representation will vary depending on your chosen language and the availableconstructs in that language. For example, if you're using Java, you might choose anObject instead of a struct. 1. Implement your data representation in your chosen language.2. Write a program that implements the DFA from Figure 1.4 of the textbook as aninstance of the DFA data representation that you have chosen. This program must alsorespond to the following stdin inputs as follows:o states: print out the states, one per line, in no particular ordero alpha: print out the alphabet, one char per line, in no particular ordero transitions: print out, in no particular order, each possible transition on its ownline: "from" state first, followed by input char, followed by "to" state, with a spaceseparating each.o start: print out the start state, on its own lineo accepts: print out the accept states, one per line, in no particular order192930,1FIGURE1.4A finite automaton called M1 that has three states

Given question has asked to create code for DFA for given automata. The required program should…

Answered: 1. Implement your data representation…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Please help me in this python code get me output of it and resolve error if posible i posted pictures of my question for your help

import sys

def main():
transition = [[[0,1],[0]], [[4],[2]], [[4],[3]], [[4],[4]]]
input = raw_input("enter the string:")
input = list(input) #copy the input in list because python strings are immutable and thus can't be changed directly
for index in range(len(input)): #parse the string of a,b in 0,1 for simplicity
if input[index]=='a':
input[index]='0'
else:
input[index]='1'

final = "3" #set of final states = {3}
start = 0

trans(transition, input, final, start)
print ("rejected")

def trans(transition, input, final, state):
for each in transition[state][int(input[0])]: #check for each possibility
if each < 4: #move further only if you are at non-hypothetical state
state = each
if len(input)==1:
if (str(state) in final): #last symbol is read and current state lies in the set of final states
print ("accepted")
sys.exit()
else:
continue
trans(transition, input[1:], final, state) #input string for next transition is input[i+1:]

main()

2. Write up an informal description of your chosen representation in a section of your
README, labeled DFA Data Representation.
For example, here's mine in Racket:
DFA Data Representation:
A State is a string
A Symbol is a 1-char string
A DFA is a (struct states alpha delta start accepts)
where:
- states is a list of State
- alpha is a list of Symbol
- delta is a hash of State Symbol -> Symbol
- start is a State
- accept is a list of State
-
Note that structs, strings, lists, and hashes are data structures in my language. Your
data representation will vary depending on your chosen language and the available
constructs in that language. For example, if you're using Java, you might choose an
Object instead of a struct.

1. Implement your data representation in your chosen language.
2. Write a program that implements the DFA from Figure 1.4 of the textbook as an
instance of the DFA data representation that you have chosen. This program must also
respond to the following stdin inputs as follows:
o states: print out the states, one per line, in no particular order
o alpha: print out the alphabet, one char per line, in no particular order
o transitions: print out, in no particular order, each possible transition on its own
line: "from" state first, followed by input char, followed by "to" state, with a space
separating each.
o start: print out the start state, on its own line
o accepts: print out the accept states, one per line, in no particular order
1
92
93
0,1
FIGURE
1.4
A finite automaton called M1 that has three states

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions