Structured Active Recall for Complex Coursework.
Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.
Start Free Sprint →DFA/NFA conversions, Regular Expressions, Pumping Lemma for Regular Languages, Context-Free Grammars (CFG), Pushdown Automata (PDA), and Turing Machines.
Key Points: State lemma: for any regular language L with pumping length p, string s with |s| >= p can be split s = xyz where |xy| <= p, |y| >= 1, and xy^i z in L for all i >= 0. Choose s = a^p b^p. Substring y must contain only a-symbols (y = a^k, k>=1). Pump i=0 => xy^0 z = a^(p-k) b^p where number of a != number of b, contradiction.
Key Points: Push matching symbols into stack while reading w in state q0. On reading separator symbol c, transition to state q1 without changing stack. In state q1, pop matching symbols for w^R. On reaching end of input ($) with empty stack (Z0), pop Z0 to accept.
Upload your Automata Theory and Computability lecture slides to generate spaced repetition study cards in seconds.
Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.
Start Free Sprint →