Grammars and languages (intro)
Boolean algebra and computation basics · Mathematics
Study notes
Q: Grammar S → aSb | ε. Derive 'aabb' and describe the language. S ⇒ aSb ⇒ aaSbb ⇒ aabb (apply S→ε at the end). Language: aⁿbⁿ for n ≥ 0 - equal a's then b's! 'aab' impossible: S always adds a AND b together. (Not regular - needs memory!)