7: A little challenging, but the peter peter arguments are similar to those in Theorem.5.
9: Again, a test of understanding equivalences involving a short proof by contradiction.
Construct Mt such that tail (L) L (Mt ).
It is for most a very dicult exercise, since it involves a good grasp of the use of substitutions.This exercise may be suitable for an extra-credit peter assignment for the better students.The problems are not too dicult, for example, the solution to part (b) can be constructed by.S1, where S1 derives.12: A good exercise that involves a simple, but not obvious trick.Students will peter probably need to try a few examples by hand before discovering an answer such as the one below.6: This is fairly easy to see.To prove it, show that every nonempty string in L (G) can still be derived.Download, report, facebook, embed Size (px) 344 x 292429 x 357514 x 422599 x 487.Try instead V1 xV2 V1 V1 x with x some linz nonterminal constant that is eventually linz replaced.12.3 The Post Correspondence Principle.I consider exercises not just a supplement to the lectures, butthat to a large extent, the lectures should be a preparation peter for the is implies that one needs to emphasize those issues that will help the stu-dent to solve challenging problems, with the basic peter ideas.
Also, it gives students an immediate introduction to the kinds of problems they cheat will face later.
Use M1 and M2 as in the solution of Exercise.
If students are struggling with server this material, extra time will be needed to remedy the situation.
One way to go about it is crysis to note that the complement of L is closely related crysis to an bn an1 bn an2 bn, then using closure under complementation.0/0 0/1 game 1/1 1/0 11: A fairly simple solved exercise.16: Quite hard, but the given solution should help students in the next exercise.2: A reminder of derivation trees.By denition, w L if and only if (q0, w).Since the proof of the theorem is tedious and intricate, you may want to skip it altogether.2: A three-state solution is (q0, a) (q1, a, R) folder (q1, a) (q1, b) (q1, a, R) (q1, ) (q2, R) xxxxlinzIM 2011/1/14 15:44 page 46 #46 46 Chapter 9 : with.Chapter 2 Finite Automata.1 Deterministic Finite Accepters 1: A drill exercise to see if students can follow the workings of a dfa.Then we can make no more than ve crysis moves before repeating a conguration.