[Solved]Theory Computation Winter 2019 Csc 4500 Third Examination April 22 2019 Notes Answer Six Q Q37209219

Theory of Computation Winter 2019 CSC 4500 Third Examination (April 22, 2019) Notes: Answer all the SIX questions. It is a closed book examination which promptly ends at 2:15 P.M. Good luck! O.I Maximum score 20 Show that the language (w-st: s ea,b)” and t € {b,c)” and #ds)-2#ds) and #dt)- 3s(t) Jis not regular [Hint choose w – bPa’c3bP as the string and use Pumping Lemma Q. 2 Maximum score 20 Let L-(w (a,b): the first. middle, and last characters of w are identical. Give a context free grammar that generates L Q. 3 Maximum score 15 pair of consecutive O’s and at most one pair of consecutive I’s. 0. 4 Maximum score 15 Draw a deterministic finite automaton (DFA) for the set of binary strings with at most one Give the regular expression for the following NFA. aximum score 20 Convert the following context free grammar to Chomsky Normal Form. Here A is the state. Show each step. B B2 imum score 10 scribe a TM, and give transition rules, which will accept binary numbers which dd integers. Show transcribed image text Theory of Computation Winter 2019 CSC 4500 Third Examination (April 22, 2019) Notes: Answer all the SIX questions. It is a closed book examination which promptly ends at 2:15 P.M. Good luck! O.I Maximum score 20 Show that the language (w-st: s ea,b)” and t € {b,c)” and #ds)-2#ds) and #dt)- 3s(t) Jis not regular [Hint choose w – bPa’c3bP as the string and use Pumping Lemma Q. 2 Maximum score 20 Let L-(w (a,b): the first. middle, and last characters of w are identical. Give a context free grammar that generates L Q. 3 Maximum score 15 pair of consecutive O’s and at most one pair of consecutive I’s. 0. 4 Maximum score 15 Draw a deterministic finite automaton (DFA) for the set of binary strings with at most one Give the regular expression for the following NFA. aximum score 20 Convert the following context free grammar to Chomsky Normal Form. Here A is the state. Show each step. B B2 imum score 10 scribe a TM, and give transition rules, which will accept binary numbers which dd integers.

Expert Answer

---

Answer to Theory of Computation Winter 2019 CSC 4500 Third Examination (April 22, 2019) Notes: Answer all the SIX questions. It is… . . .