Normal Forms
Western Michigan University CS6800 Advanced Theory of Computation Spring 2014 By Abduljaleel Alhasnawi & Rihab Almalki. Normal Forms. Grammar: G = (V, , R, S). = { a, b }. Terminals . Terminals and Non terminals. V = {A , B, C , a ,b, c}. S. Start Symbol. R = S → A.
1.16k views • 41 slides