This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (Book ID: B0972) Assignment Set – 1 (60 Marks) Answer the following questions 10 6 = 60 1. Prove that “A tree G with n vertices has (n–1) edges” 2. If ) }, , 1 { }, 1 , { }, ({ S G then find L(G), the language generated by G. 3. Obtain a DFA to accept strings of a’s and b’s starting with the string ab. 4. Briefly describe Moore and Mealy machines. 5. Draw the state diagram for the finite automation M = (Q, , q , , F) where = {a, b}, Q = {q , q 1 , q 2 }, F = {q , q 1 }, : Q Q defined by 6. Obtain a regular expression such that } 1 , { / { ) ( w R L } with atleast three consecutive 0’s. a b q q q 1 q 1 q q 2 q 2 q 2 q 2...
View
Full Document
 Fall '10
 Ramon
 following questions, Mathematical logic, Moore machine, Assignment Set, Bachelor of Computer Application

Click to edit the document details