vault backup: 2025-04-08 09:21:02

.obsidian/workspace.json

@@ -213,6 +213,7 @@
   "lastOpenFiles": [
     "Concurrent Systems/slides/class 11.pdf",
     "Concurrent Systems/notes/11 - non so cosa faremo oggi.md",
+    "Pasted image 20250408091924.png",
     "Concurrent Systems/notes/10 - Implementing Consensus.md",
     "Concurrent Systems/notes/2 - Fast mutex by Lamport.md",
     "Concurrent Systems/notes/4 - Semaphores.md",
@@ -255,7 +256,6 @@
     "Concurrent Systems/slides/class 8.pdf",
     "Concurrent Systems/notes/images/Pasted image 20250324091452.png",
     "Concurrent Systems/notes/images/Pasted image 20250324082534.png",
-    "Concurrent Systems/notes/images/Pasted image 20250324082545.png",
     "Senza nome.canvas"
   ]
 }

Concurrent Systems/notes/11 - non so cosa faremo oggi.md

@@ -9,5 +9,10 @@ A (finite non-deterministic) automaton is a quintuple M = (Q,Act,q0,F,T), where:
 Automata Behaviour: language equivalence
 	(where L(M) is the set of all the sequences of input characters that bring the automaton M from its starting state to a final one)
 
->[!note]
+>[!note] Language equivalence
 >M1 and M2 are *language equivalent* if and only if L(M1)=L(M2)
+
+![](../../Pasted%20image%2020250408091924.png)
+By considering the starting states as also final, they both generate the same language, i.e.:
+				(20.(tea + 20.coffee))∗ = (20.tea + 20.20.coffee)∗
+