Formal Languages and Automata

<aside> 💡 Preliminaries

1. Mathematical Knowledge

</aside>

<aside> 📠 Finite Automata

2. Finite Automata

Accept of Input, Language of an Automaton

3. Deterministic Finite Automata

Formalism, Graph, Regular Language

4. Nondeterministic Finite Automata

$\rm \epsilon-NFA$, Conversion

</aside>

<aside> 🔛 Regular Expressions

5. Regular Expressions

Definition, Re&FA Conversion, Algebraic

6. Decision Properties of Regular Languages

The Pumping Lemma, Minimal DFA

7. Closure Properties of Regular Languages

Homomorphism

</aside>

<aside> 🎄 Context-Free Grammars

8. Context-Free Grammars

Formalism, Derivations, BNF

9. Parse Trees

Ambiguity

10. Normal Forms for CFG’s

</aside>

<aside> 📌 Pushdown Automata

11. Pushdown Automata

12. Equivalence of PDA, CFG

13. The Pumping Lemma for CFL’s

The Pumping Lemma

14. Properties of Context-Free Languages

Decision, Closure

</aside>

<aside> 🖥️ Turing Machine

15. Turing Machines

16. More About Turing Machines

17. Decidability

18. Complexity

</aside>

<aside> 🗿 Modeling

19. Transition System

10. Petri Net

11. Timed Automata

建模会考！

</aside>