# Usage:

# python$3$ dfa.py $0110010$

# Write a dimulator of a deterministic finite automata

import numpy as np

import sys

alphabet $=[\text{'}0\text{'},\text{'}1\text{'}]$

states $=[\text{'}$q$\text{'},\text{'}$r$\text{'}]$

accepting$\_$states $=\{\text{'}$q$\text{'}\}$

transition $=$ np$.$empty$(($len$($states$),$len$($alphabet$)),$ dtype$=\text{'}$U$1\text{'})$

transition$[$states$.$index$(\text{'}$q$\text{'}),$alphabet.index$(\text{'}0\text{'})]=\text{'}$r$\text{'}$

transition$[$states$.$index$(\text{'}$q$\text{'}),$alphabet.index$(\text{'}1\text{'})]=\text{'}$q$\text{'}$

transition$[$states$.$index$(\text{'}$r$\text{'}),$alphabet.index$(\text{'}0\text{'})]=\text{'}$q$\text{'}$

transition$[$states$.$index$(\text{'}$r$\text{'}),$alphabet.index$(\text{'}1\text{'})]=\text{'}$r$\text{'}$

def DFA$($input$)$:

current$\_$state $=$ states$[0]$

for symbol in input:

current$\_$state $=$ transition$[$states$.$index$($current$\_$state$),$alphabet.index$($symbol$)]$

return current$\_$state

def main$()$:

input$\_$string $=$ input$()$

final$\_$state $=$ DFA$($input$\_$string$)$

if final$\_$state in accepting$\_$states:

print$("$Accept$")$

else:

print$("$Reject$")$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$