From 75b7052e7c3829ca7c7f584072192ab7c2392d7b Mon Sep 17 00:00:00 2001
From: deadsmond <01.lewicki@gmail.com>
Date: Mon, 25 Nov 2019 20:48:03 +0100
Subject: [PATCH] 'hm'

---
 TaskB01/run | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/TaskB01/run b/TaskB01/run
index c5aefe0..fa18ae1 100644
--- a/TaskB01/run
+++ b/TaskB01/run
@@ -38,14 +38,15 @@ class automata:
         # for all values in text
         for i in text:
             # for all actual states
+            result = []
             for q in self.state:
                 # move state to its transition
-                q = self.get_node_transition(q, i)
+                result = self.get_node_transition(q, i)
             # if the list is empty, return false
             if not self.state:
                 return False
             # flatten list of states
-            self.state = [item for sublist in self.state for item in sublist]
+            self.state = [item for sublist in result for item in sublist]
             print(self.state, i)
         # check if automata is in accepting state
         return self.check_if_accepted()
@@ -58,16 +59,12 @@ class automata:
         result = []
         # if the node exists
         if self.graph[q]:
-            print(self.graph[q])
             # search through all its connections to find value
             for connections in self.graph[q]:
-                print(connections)
                 for value in connections:
-                    print(value, i)
                     if value == i:
                         # append next node
                         result.append(connections[value])
-                        print(result)
         # return list of next nodes
         return result