Homework, UMBC CMSC451h, Automata Theory, Spring 2010

Homework Assignments

Exercise 1.4, part f, page 83.
Exercise 1.5, part f, page 84.
Exercise 1.6, part j, page 84.
Further Instructions: Argue using a formal mathematical proof that your DFA recognizes the language given in the problem.
Problem 1.36, page 89.
Further Instructions: Present an abstract definition of your DFA. That is, specify the input-output relation of the transition function δ mathematically.
Problem 1.37, page 89.
Note: Assume the input x ∈ {0,1}^*. This bit pattern x represents a number in base 2 (binary). We want that number to be divisible by n. The most significant bit of x will be read by the DFA first.

Hint: The C₂ case is trivial, since we can detect divisibility by 2 just by looking at the least significant bit. First show that C₃ is regular. Then argue that your method generalizes to any integer n ≥ 3.

Exercise 1.7, part c, page 84.
Exercise 1.7, part e, page 84.
Problem 1.40, part b only, page 89.
Note: you are being asked to show that if A is regular then NOEXTEND(A) is also regular.
Problem 1.43, page 90.

Exercise 1.16, part a, page 86.
Exercise 1.18, parts f, h & j, page 86.
I.e., give regular expressions for the languages specified in 1.6.f, 1.6.h and 1.6.j on page 84. Briefly explain the main parts of your expression.
Exercise 1.21, part a, page 86.
Problem 1.39, page 89.
Further Instructions: First write down what you need to show in order to prove the claim.

Exercise 1.46, parts a, c & d, page 90.
Exercise 1.57, page 92.
Exercise 2.4, part c, page 128.
Further Instructions: briefly document your grammar. That is, for each variable in your grammar, explain briefly which strings are derived from that variable.
Exercise 2.6, part b, page 129.
Further Instructions: briefly document your grammar. That is, for each variable in your grammar, explain briefly which strings are derived from that variable.

Give a high-level description of a pushdown automaton (PDA) for the following language and then draw the transition diagram for your PDA.
L₂ = { aⁱ b^j c^k | i ≠ j or j ≠ k }
Note: a high-level English description of your PDA has comments like "push X whenever a 0 is read."
Problem 2.20, page 130.
Problem 2.22, page 130.
Problem 2.26, page 130.

Use the pumping lemma for regular languages to show that the following language is not regular:
A = { x ∈ {0,1}^* | x has exactly three 0's, the length of x is odd and the middle symbol of x is 0. }
Problem 2.30, part a, page 131.
Problem 2.30, part d, page 131.
Problem 2.31, page 131.

Problem 3.11, page 161.
Problem 3.12, page 161.
Problem 3.13, page 161.
Problem 3.19, page 162.
Hint: you may assume that Problem 3.18 has been solved.

Problem 5.24, page 212.
Problem 5.25, page 212.
A set is cofinite if it is the complement of a finite set. Let
COF = { < M > | M is a TM and L(M) is cofinite}
FIN = { < M > | M is a TM and L(M) is finite}
Prove that FIN ≤_m COF. That is FIN reduces to COF via a many-one reduction (a.k.a. a "mapping" reduction).

Express the following language using first-order quantifiers (∃ and ∀ over natural numbers or strings) and a decidable predicate:
EQUIV_TM = { ⟨ M₁, M₂ ⟩ | L(M₁) = L(M₂) }
Show that K₁₇ defined below is ≤_m-complete for the Turing recognizable languages.
K₁₇ = { ⟨ M ⟩ | L(M) contains at least 17 strings }

Note: as a consequece K₁₇ is undecidable.
Let EQ₁₇ be as defined below. Show that the complement of A_TM ≤_m-reduces to EQ₁₇.

EQ₁₇ = { ⟨ M ⟩ | L(M) contains exactly 17 strings }

Note: as a consequece EQ₁₇ is not Turing-recognizable.
Problem 6.6, page 242.

Last Modified: 7 May 2010 21:51:05 EDT by Richard Chang