From c96289d584b2f8a0f8bbeb3dc4f3944717aeb90d Mon Sep 17 00:00:00 2001
From: KevinZonda <33132228+KevinZonda@users.noreply.github.com>
Date: Sat, 26 Feb 2022 21:44:12 +0000
Subject: [PATCH] feat: upd: content

---
 README.md     | 1 +
 note/Week3.md | 4 ++--
 2 files changed, 3 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index bd541b2..890c7de 100644
--- a/README.md
+++ b/README.md
@@ -13,3 +13,4 @@
 
 - [Week 1: Regex, DFA, NFA & Kleene's Theorem](note/Week1.md)
 - [Week 2: Equivalence, Minimal, Minimisation Automata & Non-regular Language](note/Week2.md)
+- [Week 3: Induction & Context-free Language](note/Week3.md)
diff --git a/note/Week3.md b/note/Week3.md
index 994d3df..72ef46d 100644
--- a/note/Week3.md
+++ b/note/Week3.md
@@ -1,4 +1,4 @@
-# Week 3:
+# Week 3: Induction & Context-free Language
 
 ## Induction
 
@@ -32,7 +32,7 @@ Let $P\in\mathbb{N}$
 *Assume:* $n\in\mathbb{N}$ and $n\geq 0$, $\forall n'\in \mathbb{N},\ n'\in[1, n).\ P(n') \text{ is true}$  
 *Proof:* $P(n)$ is True.
 
-## Context-Free Language
+## Context-free Language
 
 ### Definition