Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
sidebar [2025/05/19 10:24] cata_chiru |
sidebar [2025/10/28 00:52] (current) rares_stefan.balcan |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| * [[aa:intro:rules|Regulament]] | * [[aa:intro:rules|Regulament]] | ||
| * Lectures: | * Lectures: | ||
| - | * [[aa:lecture0|3 Problems Challenge]] | + | * TBA |
| - | * [[aa:lecture1|Problems and Algorithms + Turing Machines]] | + | |
| - | * [[aa:lecture2|Computing]] | + | |
| - | * [[aa:lecture3|Multitape TMs + Universal TMs]] | + | |
| - | * [[aa:lecture4|Undecidable problems]] | + | |
| - | * [[aa:lecture5|Reductions]] | + | |
| - | * [[aa:lecture6|Undecidability Results]] | + | |
| - | * [[aa:lecture7|Computational resources]] | + | |
| - | * [[aa:lecture8|Complexity across computational models]] | + | |
| - | * [[aa:lecture9|"Hard?" problems]] | + | |
| - | * [[aa:lecture10|Polynomial-time reductions]] | + | |
| - | * [[aa:lecture11|P vs. NP]] | + | |
| - | * [[aa:lecture12|Hardness and completeness]] | + | |
| - | * [[aa:lecture13|Recurrence relations]] | + | |
| - | * [[aa:lecture14|The Master Method]] | + | |
| - | * [[aa:lecture15|Quicksort]] | + | |
| - | * [[aa:lecture16|Amortized Analysis]] | + | |
| - | * [[aa:lecture17|Algebraic Data Types]] | + | |
| - | * [[aa:lecture18|Structural Induction]] | + | |
| * Labs: | * Labs: | ||
| - | * [[aa:lab:0|Math recap]] | + | * [[aa:lab:1|Laboratorul 1 - Text editor]] |
| - | * [[aa:lab:1|Turing Machines]] | + | * [[aa:lab:2|Laboratorul 2 - Notații asimptotice și analiză amortizată]] |
| - | * [[aa:lab:2|Computing]] | + | * [[aa:lab:3|Laboratorul 3 - Analiză Amortizată și TDA-uri]] |
| - | * [[aa:lab:3|Reduceri]] | + | * [[aa:lab:4|Laboratorul 4 - Inducție structurală]] |
| - | * [[aa:lab:4|Mai multe reduceri]] | + | |
| - | * [[aa:lab:5|Notații asimptotice]] | + | |
| - | * [[aa:lab:6|Hard Problems]] | + | |
| - | * [[aa:lab:8|Polynomial-time reductions]] | + | |
| - | * [[aa:lab:9|Hardness and Completeness]] | + | |
| - | * [[aa:lab:10|Recurrence relations]] | + | |
| - | * [[aa:lab:10:b|Recurrence relations (part 2)]] | + | |
| - | * [[aa:lab:11|Amortized Analysis]] | + | |
| - | * [[aa:lab:12|Structural Induction]] | + | |
| <-- | <-- | ||
| --> Formal Languages and Automata# | --> Formal Languages and Automata# | ||
| - | * [[lfa:2023 | LFA 2023-2024]] | + | * [[lfa:2024 | LFA 2024-2025]] |
| - | * [[lfa:2024:team | Echipa ]] | + | * [[lfa:2025:team | Echipa ]] |
| - | * [[lfa:2024:intro:rules | Regulament ]] | + | * [[lfa:2025:intro:rules | Regulament ]] |
| - | * Lectures /* | + | * Lectures |
| + | |||
| + | * Labs | ||
| + | * [[lfa:2025:lab01 | 1. DFA ]] | ||
| + | * [[lfa:2025:lab02 | 2. Programming introduction - Python ]] | ||
| + | * [[lfa:2025:lab03 | 3. RegEx]] | ||
| + | * [[lfa:2025:lab04 | 4. RegEx -> NFA]] | ||
| + | |||
| + | /* | ||
| * [[lfa:2024:c01 | 1. ???]] | * [[lfa:2024:c01 | 1. ???]] | ||
| - | */ | ||
| * Proiect | * Proiect | ||
| * [[lfa:2024:proiect | Etapa 1]] | * [[lfa:2024:proiect | Etapa 1]] | ||
| Line 67: | Line 47: | ||
| * [[lfa:2024:lab10 | 10. Context-Free Grammars]] | * [[lfa:2024:lab10 | 10. Context-Free Grammars]] | ||
| * [[lfa:2024:lab11 | 11. Closure properties for Context-Free Languages]] | * [[lfa:2024:lab11 | 11. Closure properties for Context-Free Languages]] | ||
| + | |||
| + | */ | ||
| /* | /* | ||
| + | |||
| * [[lfa:2023:proiect | Proiect ]] | * [[lfa:2023:proiect | Proiect ]] | ||
| * [[lfa:2023:proiect_coding_style | Coding Style ]] | * [[lfa:2023:proiect_coding_style | Coding Style ]] | ||
| Line 101: | Line 84: | ||
| * [[pp:2025:l09 | L09: Lazy Evaluation]] | * [[pp:2025:l09 | L09: Lazy Evaluation]] | ||
| * [[pp:2025:l10 | L10: Functors & Monads]] | * [[pp:2025:l10 | L10: Functors & Monads]] | ||
| - | * [[pp:2025:l11 | L11: TODO]] | + | * [[pp:2025:l11 | L11: Classes, Applicatives and More Monads]] |
| * Homeworks | * Homeworks | ||