Automata v.1.2.0

NFA module incorporated; examples of DFA and NFA setted on different files and with differents automatons :3

Author: arhcoder

dfa-example-1.py

@@ -0,0 +1,26 @@
+from dfa import DFA
+
+if __name__ == "__main__":
+
+    # First example of DFA Automata instance:
+    # Language of the Automata:
+    # L(Automata) = {(b^n)a(w): n>=0, w in {a, b}*};
+    # Any string with at least one "a";
+    Automata = DFA()
+    Automata.setStates({"q0", "q1"})
+    Automata.setAlphabet({"a", "b"})
+    Automata.setInitial("q0")
+    Automata.setFinals({"q1"})
+    Automata.addTransition(("q0", "a", "q1"))
+    Automata.addTransition(("q0", "b", "q0"))
+    Automata.addTransition(("q1", "a", "q1"))
+    Automata.addTransition(("q1", "b", "q1"))
+
+    #/ Executes the Automata:
+    while True:
+        print()
+        word = input("Cadena: ")
+        if Automata.accepts(word, stepByStep=True):
+            print(f"La cadena \"{word}\" SÍ es aceptada!")
+        else:
+            print(f"La cadena \"{word}\" NO es aceptada!")

dfa-example-2.py

@@ -0,0 +1,56 @@
+from dfa import DFA
+
+if __name__ == "__main__":
+
+    # Second example of DFA Automata instance:
+    # Language of the Automata:
+    # L(Automata) = All strings with at least one "a",
+    # and exactly two b's:
+    #* States:
+    Q = {"q0", "qa", "q1", "qb", "q2", "qf", "qx"}
+
+    #* Alphabet:
+    A = {"a", "b"}
+
+    #* Transitions:
+    T = []
+
+    #* Starting state:
+    S = "q0"
+
+    #* Finals states:
+    F = {"qf"}
+
+    #* Transitions definition:
+    T.append( ("q0", "a", "qa") )
+    T.append( ("q0", "b", "q1") )
+
+    T.append( ("qa", "a", "qa") )
+    T.append( ("qa", "b", "qb") )
+
+    T.append( ("q1", "a", "qb") )
+    T.append( ("q1", "b", "q2") )
+
+    T.append( ("qb", "a", "qb") )
+    T.append( ("qb", "b", "qf") )
+
+    T.append( ("q2", "a", "qf") )
+    T.append( ("q2", "b", "qx") )
+    
+    T.append( ("qf", "a", "qf") )
+    T.append( ("qf", "b", "qx") )
+
+    T.append( ("qx", "a", "qx") )
+    T.append( ("qx", "b", "qx") )
+
+    #? Automata:
+    Automata = DFA(Q, A, T, S, F)
+
+    #/ Executes the Automata:
+    while True:
+        print()
+        word = input("Cadena: ")
+        if Automata.accepts(word, stepByStep=True):
+            print(f"La cadena \"{word}\" SÍ es aceptada!")
+        else:
+            print(f"La cadena \"{word}\" NO es aceptada!")

dfa.py

@@ -48,7 +48,7 @@ def __init__(self, states: set={}, alphabet: set={}, transitions: list=[], initi
                 * "a" is the symbol that will read on the actual state;
                 * "q1" is the next state after the symbol reading;
             Example of transitions set:
-            {} ("q0", "a", "q1"),  ("q0", "b", "q1"),  ("q1", "a", "q1")" };
+            { ("q0", "a", "q1"),  ("q0", "b", "q1"),  ("q1", "a", "q1")" };
 
             4. "initial" (string): Represents your initial state.
             If it is not included in "states", it will add on it;
@@ -62,16 +62,14 @@ def __init__(self, states: set={}, alphabet: set={}, transitions: list=[], initi
 
         # The values of the automata #
         self.States = states
-        self.Alphabet = states
+        self.Alphabet = alphabet
         self.Transitions = transitions
         self.Initial = initial
         self.Finals = finals
         self.actual = initial
-        self.transitionsCount = 0
 
     #* Getter:
     def __getattribute__(self, __name: str):
-        # print('__getattribute__ ', __name)
         return super(DFA, self).__getattribute__(__name)
 
     #* Setters:

examples-dfa.py

@@ -0,0 +1,42 @@
+from nfa import NFA
+
+if __name__ == "__main__":
+
+    # First example of NFA Automata instance:
+    # Language of the Automata:
+    # L(Automata) = {aba(b^n): n>0} U
+    # {ab(a^n): n>=0};
+    #* States:
+    Q = {"q0", "qa", "qab", "qf", "qabf"}
+
+    #* Alphabet:
+    A = {"a", "b"}
+
+    #* Transitions:
+    T = []
+
+    #* Starting state:
+    S = "q0"
+
+    #* Finals states:
+    F = {"qf", "qabf"}
+
+    #* Transitions definition:
+    T.append( ("q0", "a", "qa") )
+    T.append( ("qa", "b", "qab") )
+    T.append( ("qab", "a", "qf") )
+    T.append( ("qf", "b", "qf") )
+    T.append( ("qab", "", "qabf") )
+    T.append( ("qabf", "a", "qabf") )
+
+    #? Automata:
+    Automata = NFA(Q, A, T, S, F)
+
+    #/ Executes the Automata:
+    while True:
+        print()
+        word = input("Cadena: ")
+        if Automata.accepts(word, stepByStep=True):
+            print(f"La cadena \"{word}\" SÍ es aceptada!")
+        else:
+            print(f"La cadena \"{word}\" NO es aceptada!")

nfa-example-1.py

@@ -0,0 +1,26 @@
+from nfa import NFA
+
+if __name__ == "__main__":
+
+    # Second example of NFA Automata instance:
+    # Language of the Automata:
+    # L(Automata) = {(a^n): n>=0} U {(b^n)a: n>=1};
+    Automata = NFA()
+    Automata.setStates({"q0", "qb", "qa", "qba"})
+    Automata.setAlphabet({"a", "b"})
+    Automata.setInitial("q0")
+    Automata.setFinals({"qa", "qba"})
+    Automata.addTransition(("q0", "", "qa"))
+    Automata.addTransition(("q0", "b", "qb"))
+    Automata.addTransition(("qa", "a", "qa"))
+    Automata.addTransition(("qb", "a", "qba"))
+    Automata.addTransition(("qb", "b", "qb"))
+
+    #/ Executes the Automata:
+    while True:
+        print()
+        word = input("Cadena: ")
+        if Automata.accepts(word, stepByStep=True):
+            print(f"La cadena \"{word}\" SÍ es aceptada!")
+        else:
+            print(f"La cadena \"{word}\" NO es aceptada!")