Arden's Theorem: Convert Finite Automata to Regex

Theory of Computation:
1) Motivation behind the subject: https://youtu.be/zq2jbZwUuxc
2) Examples of Computation model using Finite State Machine: https://youtu.be/RZPVqlJhjzU
3) Finite Automata-Definition with example: https://youtu.be/6pz-OTtxRo8
4) Examples of Finite Automata: https://youtu.be/lsrUBgqB_oE
5) NFA and DFA in Finite Automata: https://youtu.be/pWOeFWMX9Gk
6) Conversion from NFA to DFA: https://youtu.be/Y0icgUWB4QA
7) Introduction to Mealy and Moore Machine: https://youtu.be/FTkeOYtAKkU
8) Mealy Machine with Example: https://youtu.be/glRTOiSgrrc
9) Moore Machine with example: https://youtu.be/OoQ0q6MzIxw
10) Conversion from Mealy to Moore: https://youtu.be/p1jt5bbHB54
11) Conversion from Moore to Mealy: https://youtu.be/Y9koamkyZBU
12) Regular Expressions: https://youtu.be/KtP8JuadUdQ
13) Arden's Theorem: https://youtu.be/uzMb__h7Co8
14) Pumping Lemma: https://youtu.be/isRk6xUsnK8
15) Pushdown Automata: https://youtu.be/jhMWPG6S_FI