6.045J/18.400J: Automata, Computability and Complexity
Prof. Nancy Lynch
Homework 2
Due: Tuesday, February 20, 2007 Reading: Sipser, Sections 1.2 and 1.3. Problem 1: Designing DFAs and NFAs. For each
6.045J/18.400J: Automata, Computability and Complexity
Nancy Lynch
Homework 12
Due: May 7, 2007 Readings: Section 9.1, 9.2 Problem 1: Sipser 9.13 Let pad(s, l) be the function that adds enough copies
6.045J/18.400J: Automata, Computability and Complexity
Nancy Lynch
Homework 11
Due: April 30, 2007 Readings: Sections 7.4, 7.5, Garey-Johnson (optional) (Some of the solutions are borrowed from Susa
6.045J/18.400J: Automata, Computability and Complexity
Nancy Lynch
Homework 10
Due: April 23, 2007 Readings: Sections 7.4, 7.5 Problem 1: Let A and B be nontrivial languages over an alphabet (that
X Tcfw_Tcfw_e e X ` f g I Bn&Td d0)~0e X V X ` V X V X X X X X f ` V f a V X TSlFcfw_bcfw_lFwl0ub 7 TDn&Ww)T)cfw_~T$)FYTlwd0Y 0b0T~)Tb0w)TYYlwTlI7) ` X f ` f V f ` ` V X f ` ` V f V f 0)~b0Yw~8qT0b~c
F
x V u ` x X x cfw_ w cfw_ V f cfw_ x ` X | ` x z w f l)Y)b0)4Tblb0e cfw_ v x ` ` V cfw_ | X w x | Cqqql~Y)~$S) l BFqqqlV l u w cfw_ v x ` ` X |u cfw_ `u V y cfw_ X | ` Xu | | x f cfw_ cfw_ x x z x
|cfw_z X y x` cfw_ 00lS)jbfolz V X y cfw_ X x cfw_ X V ` f ` f X z y x ` x z z X cfw_ V y cfw_ x a z x x z cfw_ f z X V )l)Y)&dk0F)ed)l)YbTj0Y)S$j&4eWj)jlr)T4j0cfw_ $oTS)Yo S0o $k$e $k)40&4)efj0lS0$l
~ ` V ~ ` V $sssq)sFsssYw X cfw_ X !q)q ~ X X W)!F! $m$TSqTs)T)$sssY)0T)sb0Yr7 ~ ` z z f ~ cfw_ ~ ` ` V ~ ` ` V X cfw_ X qj) cfw_ V ~ V cfw_ z ~ ` z ~ X cfw_ sd0YTsYwYTDmTYq X z ~ V X V V cfw
F
w V YTpV V )X p u f f 4u r` $ a Y ` $ F T bCr u V 0T V F ` YV 0 0YV 0 V ` X Fr0 dYV 0)$ t X FrTTbCr0YrTrT0prpbTrT0$ V X w G #@ " A ) T0` ) iY ) peCB$C&# Y r Y) f Y f p X e V X f T Y I &Y f j Yp Y0
e W W FanTfrx
` c c W c e g e V e W e W e W V V c TYnfd)Tn)zf$)ffTV e W WX s V e W g W ` c p e V g V g W V s ` ` V % QA 9 # )~pnDd)Th0frf!T f f00$T)0)Tddd0fdrB7p ` ann0~0!3fB x h` ` vrh!~ rv$hCn h` `
6.045J/18.400J: Automata, Computability and Complexity
Prof. Nancy Lynch
Homework 1
Due: February 12, 2007 Elena Grigorescu
Problem 1: Construct truth tables for each of the following formulas. Als