2024-02-05 13:04:48

.obsidian/hotkeys.json

@@ -6,5 +6,23 @@
       ],
       "key": "M"
     }
+  ],
+  "obsidian-git:commit": [
+    {
+      "modifiers": [
+        "Mod",
+        "Shift"
+      ],
+      "key": "C"
+    }
+  ],
+  "obsidian-git:push2": [
+    {
+      "modifiers": [
+        "Mod",
+        "Shift"
+      ],
+      "key": "P"
+    }
   ]
 }

.obsidian/workspace.json

@@ -4,15 +4,19 @@
     "type": "split",
     "children": [
       {
-        "id": "2a93ce04c309663a",
+        "id": "52ebb891467141b2",
         "type": "tabs",
         "children": [
           {
-            "id": "330dd5719e4ea695",
+            "id": "c6e1f6f3797edf57",
             "type": "leaf",
             "state": {
-              "type": "empty",
+              "type": "markdown",
-              "state": {}
+              "state": {
+                "file": "UNB/Year 4/Semester 2/CS2333/2024-02-05.md",
+                "mode": "source",
+                "source": false
+              }
             }
           }
         ]
@@ -81,6 +85,7 @@
             "state": {
               "type": "backlink",
               "state": {
+                "file": "UNB/Year 4/Semester 2/CS2333/2024-02-05.md",
                 "collapseAll": false,
                 "extraContext": false,
                 "sortOrder": "alphabetical",
@@ -97,6 +102,7 @@
             "state": {
               "type": "outgoing-link",
               "state": {
+                "file": "UNB/Year 4/Semester 2/CS2333/2024-02-05.md",
                 "linksCollapsed": false,
                 "unlinkedCollapsed": true
               }
@@ -118,7 +124,9 @@
             "type": "leaf",
             "state": {
               "type": "outline",
-              "state": {}
+              "state": {
+                "file": "UNB/Year 4/Semester 2/CS2333/2024-02-05.md"
+              }
             }
           },
           {
@@ -148,8 +156,9 @@
       "table-editor-obsidian:Advanced Tables Toolbar": false
     }
   },
-  "active": "330dd5719e4ea695",
+  "active": "c6e1f6f3797edf57",
   "lastOpenFiles": [
+    "UNB/Year 4/Semester 2/CS2333/2024-02-05.md",
     "UNB/Year 4/Semester 2/CS3873/2024-02-05.md",
     "UNB/Year 4/Semester 2/STAT2593/2024-02-05.md",
     "UNB/Year 4/Semester 2/STAT2593/2024-02-02.md",
@@ -175,7 +184,6 @@
     "UNB/Year 4/Semester 2/STAT2593/2024-01-22.md",
     "README.md",
     "UNB/UNB.md",
-    "UNB.md",
     "gcm-diagnose.log",
     "Semester 2/STAT2593/Untitled",
     "Semester 2/STAT2593",

UNB/Year 4/Semester 2/CS2333/2024-02-05.md

@@ -0,0 +1,15 @@
+Lecture Topic: Non-determinism
+
+# So Far
+All of the finite automata have been deterministic. This means that for any combination of state and input symbol there is exactly one transition defined
+
+There are advantages to this
+- Easier to trace a string through the finite automata
+Also some disadvantages
+- Can make it harder to design
+
+Example on whiteboard
+
+In a non-deterministic finite automata (NFA), there are different paths, or choices you can make, so there can be more than one, or no transition defined for a given state.
+
+To verify a string in a NFA, you need to follow each "choice" until a string completes, (ie, for two transitions defined, fork and check both paths)