CSc 473: Homework Assignment 2
Assigned: Tuesday September 4 2012 Due: 2:00 PM, Tuesday September 18 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your
CSc 473: Homework Assignment 4
Assigned: Tuesday October 9 2012 Due: 2:00 PM, Tuesday October 23 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your wor
CSc 473 - Homework #1
September 4, 2012
1. Prove by induction that any purchase of 60 or more ED can be paid using only 7ED and 11ED bills. Basis: 60ED = 7 7ED + 1 11ED Induction step: assume a purchase of n ED can be paid using 7ED and 11ED bills, show n
CSc 473: Homework Assignment 1 Solutions
(s)/(j) indicates a problem was graded by Sabrina/Jackson, respectively.
1. (10 pts) (j) Prove the following
(a) (1 1/4) (1 1/9) (1 1/n2 ) = (n + 1)/(2n), for n 2.
Answer: The proof is by induction.
Proof. Base cas
CSc 473: Homework Assignment 2 Solutions
(S)/(J) indicates that a problem was graded by Sabrina/Jackson, respectively.
1. (10 pts) (J)
(a) Prove by construction that regular languages are closed under the complement operation. That is, given a
DFA for som
CSc 473: Homework Assignment 3
Assigned: Tuesday September 24 2014
Due: 2:00 PM, Tuesday October 8 2013
(S)/(J) indicates that a problem was graded by Sabrina/Jackson, respectively.
1. (S) (10 pts) Find regular expressions for the languages over alphabet
CSc 473: Homework Assignment 4
(S) / (J) indicates which TA graded a problem.
1. (10 pts) (J) For each of the languages below indicate whether or not it is Context Free. In each case, prove your
answer: if you believe Li is a CFL, give a CFG or a PDA for
CSc 473: Homework Assignment 6
(J)/(S) indicates a problem was graded by Jackson/Sabrina.
1. (10 pts) (J)
(a) Consider the following proof-sketch for showing that EQDF A is a decidable language: Since a DFA is a
nite machine, it either accepts a nite lang
CSc 473: Homework Assignment 5 Solutions
1. (10 pts) (S) Consider the following Dierent Turing Machine (DTM): It is similar to the standard Turing
machine but it must always write a dierent symbol from the one it reads. That is, the transitions of the DTM
CSc 473: Homework Assignment 6
Assigned: Tuesday November 6 2012 Due: 2:00 PM, Tuesday November 20 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your w
CSc 473: Homework Assignment 6
Assigned: Tuesday November 6 2012 Due: 2:00 PM, Tuesday November 20 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your w
CSc 473: Homework Assignment 5
Assigned: Tuesday October 23 2012 Due: 2:00 PM, Tuesday November 6 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your wo
CSc 473: Homework Assignment 5
Assigned: Tuesday October 23 2012 Due: 2:00 PM, Tuesday November 6 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your wo
CSc 473: Homework Assignment 4
Assigned: Tuesday October 9 2012 Due: 2:00 PM, Tuesday October 23 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your wor
CSc 473: Homework Assignment 3
Assigned: Tuesday September 18 2012 Due: 2:00 PM, Tuesday October 2 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your w
CSc 473: Homework Assignment 3
Assigned: Tuesday September 18 2012 Due: 2:00 PM, Tuesday October 2 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your w
CSc 473: Homework Assignment 2
Assigned: Tuesday September 4 2012 Due: 2:00 PM, Tuesday September 18 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your
CSc 473: Homework Assignment 1
Assigned: Tuesday August 21 2012 Due: 2:00 PM, Tuesday September 4 2012
Clear, neat and concise solutions are required in order to receive full credit so revise your work carefully before submission, and consider how your wo
Chapter 5 Context-Free Grammars and Languages
Parse Tree is the product of a parser for a programming language and is the way that the
structure of programs is normally captured.
5.1 Context-Free Grammars
o A context-free Grammar is a formal notation for