The answer MUST be code and not a description explaining the question,

Question $1($A Simple DFA$)$ Implement the DFA below in Python, push your code to gitlab.

Notes:

The alphabet is $,$

Your implementation should follow the definition of this DFA only, regardless of its capability to

capture valid arithmetic expressions in real life

Please use the following template:

import os

class DFA:def init$($self$)$:

def reset$($self$)$:

def transition$($self$,$ char$)$:

def is$\_$valid$($self$,$ string$)$:def process$\_$string$($self$,$ input$\_$string$)$:self.reset$()$

for char in input$\_$string:

self.transition$($char$)$

if self.state $==$ 'invalid':

return False

return self.is$\_$accepting$()$

def main$()$:

for i in range$(1,11)$:

file$\_$name $=$ f'test $\{$i:$02$d$\}.$txt$"$

if os$.$path.isfile$($file$\_$name$)$:

with open$($file$\_$name, $\text{'}$r$\text{'})$ as file:

input$\_$string $=$ file.read$().$strip$()$

dfa $=$ DFA$()$

if dfa.process$\_$string$($input$\_$string$)$:

print$($f$"\{$file$\_$name$\}$: Valid"$)$

else:

print$($f$"\{$file$\_$name $\}$: Invalid"$)$

else:

print$($f$"\{$file$\_$name$\}$: File not found"$)$

if $==""$:

main$()$