| .. |
|
2020-09-23 Preliminari.pdf
|
Automi 2020-09-28
|
2020-09-28 17:27:26 +02:00 |
|
2020-09-28 Automi a stati finiti.pdf
|
Automi 2020-09-28
|
2020-09-28 17:27:26 +02:00 |
|
2020-10-01 DFA.pdf
|
Automi 2020-10-01
|
2020-10-02 18:20:17 +02:00 |
|
2020-10-05 DFA - Esempi di accettazione.pdf
|
Automi 2020-10-05
|
2020-10-05 12:59:24 +02:00 |
|
2020-10-07 DFA - Computazione.pdf
|
Automi 2020-10-12
|
2020-10-12 17:24:18 +02:00 |
|
2020-10-12 Linguaggi regolari e NFA.pdf
|
Automi 2020-10-27
|
2020-10-30 15:10:42 +01:00 |
|
2020-10-14 NFA.pdf
|
Automi 2020-10-14
|
2020-10-16 11:33:17 +02:00 |
|
2020-10-19 Linguaggio di un NFA.pdf
|
Automi 2020-10-19
|
2020-10-19 17:15:06 +02:00 |
|
2020-10-20 Equivalenza tra DFA e NFA.pdf
|
Automi 2020-10-30
|
2020-10-31 12:10:33 +01:00 |
|
2020-10-22 Costruzione per sottoinsiemi.pdf
|
Automi 2020-10-22
|
2020-10-27 15:22:44 +01:00 |
|
2020-10-27 Costruzione per sottoinsiemi.pdf
|
Automi 2020-11-02
|
2020-11-02 15:12:20 +01:00 |
|
2020-10-29 NFA con epsilon-mosse.pdf
|
Elimina ripetizione
|
2020-11-02 15:17:09 +01:00 |
|
2020-10-30 Equivalenza tra epsilon-NFA e NFA.pdf
|
Automi 2020-10-30
|
2020-10-31 12:10:33 +01:00 |
|
2020-11-05 Espressioni regolari.pdf
|
Automi 2020-11-12
|
2020-11-14 13:31:15 +01:00 |
|
2020-11-09 Da espressioni regolari a epsilon-NFA.pdf
|
Automi 2020-11-09
|
2020-11-10 14:59:11 +01:00 |
|
2020-11-12 Da espressioni regolari a epsilon-NFA.pdf
|
Automi 2020-11-16
|
2020-11-16 13:16:17 +01:00 |
|
2020-11-16 Proprietà algebriche.pdf
|
Automi 2020-11-16
|
2020-11-16 13:16:17 +01:00 |
|
2020-11-17 Pumping lemma.pdf
|
Automi 2020-11-23
|
2020-11-23 19:45:52 +01:00 |
|
2020-11-20_1 Operazioni booleane.pdf
|
Automi 2020-11-20
|
2020-11-21 17:25:28 +01:00 |
|
2020-11-20_2 Inversione.pdf
|
Automi 2020-11-20
|
2020-11-21 17:25:28 +01:00 |
|
2020-11-23_1 Linguaggi non regolari.pdf
|
Automi 2020-11-23
|
2020-11-23 19:45:52 +01:00 |
|
2020-11-23_2 Grammatiche libere dal contesto.pdf
|
Automi 2020-11-23
|
2020-11-23 19:45:52 +01:00 |
|
2020-11-24_1 CFG - Derivazioni.pdf
|
Automi 2020-12-07
|
2020-12-09 11:30:45 +01:00 |
|
2020-11-24_2 CFG - Proprietà delle derivazioni.pdf
|
Automi 2020-11-30
|
2020-11-30 17:46:03 +01:00 |
|
2020-11-26_1 Linguaggio dei palindromi.pdf
|
Automi 2020-11-26
|
2020-11-27 17:09:27 +01:00 |
|
2020-11-26_2 Inferenza ricorsiva e alberi sintattici.pdf
|
Automi 2020-11-30
|
2020-11-30 17:46:03 +01:00 |
|
2020-11-30 CFG - Ambiguità.pdf
|
Automi 2020-11-30
|
2020-11-30 17:46:03 +01:00 |
|
2020-12-03_1 Automi a pila.pdf
|
Automi 2020-12-07
|
2020-12-09 11:30:45 +01:00 |
|
2020-12-03_2 PDA - Computazioni.pdf
|
Lezioni asincrone automi 2020-12-03
|
2020-12-08 20:30:27 +01:00 |
|
2020-12-03_3 PDA - Accettazione.pdf
|
Lezioni asincrone automi 2020-12-03
|
2020-12-08 20:30:27 +01:00 |
|
2020-12-07_1 Equivalenza tra CFG e PDA.pdf
|
Automi 2020-12-07
|
2020-12-09 11:30:45 +01:00 |
|
2020-12-07_2 Proprietà dei CFL.pdf
|
Automi 2020-12-07
|
2020-12-09 11:30:45 +01:00 |
|
2020-12-10 Compilatori.pdf
|
Automi 2020-12-10
|
2020-12-15 16:35:50 +01:00 |
|
2020-12-11_1 Gerarchia di Chomsky.pdf
|
Automi 2020-12-11
|
2020-12-16 18:47:35 +01:00 |
|
2020-12-11_2 Macchine di Turing.pdf
|
Correzioni slide 49 e 50 Automi
|
2020-12-17 13:31:38 +01:00 |
|
2020-12-14 Esempio di MdT.pdf
|
Automi 2020-11-16
|
2020-12-17 17:36:01 +01:00 |
|
2020-12-16 MdT - Osservazioni.pdf
|
Correzione data file Automi 2020-12-16
|
2020-12-17 17:43:16 +01:00 |
