marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

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

Browse source
This commit is contained in:
Marco Realacci 2025-04-08 09:21:02 +02:00
parent 451ea9d08c
commit 69568f719e
3 changed files with 8 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -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]
>M1 and M2 are *language equivalent* if and only if L(M1)=L(M2)
>[!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)∗