L = { a^k b^m c^k d^m | k=1,2,3,..., m=1,2,3,...}
(where x^y means x raised to the power y)
is not context-free.
Assignment #12. Due Mon, Oct 29
Textbook p. 117, exercise 3.42, parts a) and b).
Note that you need to construct a pushdown automaton (PDA) which recognizes
each of these languages and obeys the restrictions of
a deterministic PDA (p. 106).
Assignment #13. Due Fri, Nov 9
Textbook p. 151, exercise 4.1 and exercise 4.9. Also, use the
rules from 4.9 b) to compute a trace of your machine on
the input 10111.
Assignment #14. Due Fri, Nov 16
Write the transition rules for a 2-tape Turing machine
which simulates the pushdown automaton from Example 3.3.1 on
p.83 of the text. Use the technique described in class to
simulate the PDA and your machine should halt if the input
is in the language {a^n b^n} and not halt otherwise.
If you encounter unspecified details (such as exactly how
to denote transition rules for a 2-tape machine), just make
some reasonable decision and explain what you decided to do.
Assignment #15. Due Mon, Dec 3
Textbook p. 173, exercise 5.6.
Note that the book errata site suggests the sentence "Assume
some fixed alphabet for all subparts of this exercise" be
added to the end of the instructions.