Automata, Formal Languages, and Turing Machines (Emre Sermutlu)
14 courses · 769 flashcards · by lakesare
- Ch.1: Finite Automata · 39 flashcards
- Ch.2: Nondeterminism · 49 flashcards
- Ch.3: Regular Languages · 44 flashcards
- Ch.4: Regular Expressions · 53 flashcards
- Ch.5: Pumping Lemma · 49 flashcards
- Ch.6: Context-Free Grammars · 55 flashcards
- Ch.7: Different Forms of Grammars · 60 flashcards
- Ch.8: Pushdown Automata · 53 flashcards
- Ch.9: Non-Context-Free Languages · 49 flashcards
- Ch.10: Turing Machines I · 41 flashcards
- Ch.11: Turing Machines II · 60 flashcards
- Ch.12: An Undecidable Language · 64 flashcards
- Ch.13: P and NP · 84 flashcards
- Ch.14: NP-Complete Problems · 69 flashcards