Key to Homework #2 1. What is the language of L-system G = ({a, b, c}, h, acb ), where the rewriting rule h is defined as follows: h (a) = aa h (b) = cb h (c) = a Answer: Applying h iteratively on acb, we get the following: acb  aaacb  aaaaaaacb  aaaaaaaaaaaaaaacb ... The number of a’s increases with the following pattern; 1, 2+1, 4+2+1, ,..., and so on. If we apply h i times, we get string a 1 a 2 a 4....a i cb. Since i = 2 i+1 – 1, we can express the language of the L-system as follows. { a r cd | r = 2 i+1 – 1, i  0 } 2. Construct a syntax diagram which defines the language of the following context-free grammar. S  aSbB | A A  bSa | ba | ab B  bB |  SB a b A B b S B Answer: S b a a A b

4. Suppose that in the Pascal Syntax Flow Graph (see your handout) digit are defined as the following syntax flow graphs. Write a context-free grammar that generates all unsigned numbers defined by the Pascal syntax flow graph “unsigned number” in the handout. We know that digit unsigned integer For convenience, define + - sign . e |. | e |  |  1 | 2  + | - |  digit 1 2 unsigned integer.edigit + - unsigned number We use lower case letter instead of capital E, to show that it is terminal symbol. Answer: * Let denote nonterminals, and be the start symbol of the grammar.

3. What does the following Turing Machine (TM) do? Explain in detail referring to the states. Assume that the input is a string in { 0, 1 } +. (Hint: Trace the machine operation with a simple example.) (1,1,R) (0,0,R) (B,B,L) (0,0,R) (1,1,R) (B,B,L) (1,0,L) (0,1,R) start (1,B,L) (0,B,L) (0,1,L) (1,0,L) (0,0,L) (1,1,L) (B,0,N) (B,1,N) Given a binary number on the tape, the Turing machine increments and shifts it as follows: (1)In state 0, the head move all the way to the right until it the blank next to the last symbol, and back up one cell to the left and enters state 1. (2)Moving to the left changes all 1’s to 0, until it reads 0. The machine changes this 0 to 1, enters state 2 and moves all the way to the right until it hits a blank, and then back up in state 3. Above procedures (1) and (2) increment the binary number on the tape by one. (There is an exceptional case; if the number is all 1’s, the increment will be stuck at state 1, and will not work.) (3) If the machine reads symbol 0 (symbol 1), it replaces the symbol with blank and moves to the left entering state 4 (respectively, state 5). (4) Changing states between 4 and 5, the machine shifts the binary string to the left by one cell. Answer:

5. Construct a TM which, given a string x  {a, b} +, rearrange the symbols in x such that all a’s come fist then b’s follow. For example, if the input is abbaaba, then the result will be aaaabbb. When the work is complete the TM should be in an accepting state and the tape should only contain rearranged string. For your answer, you should first informally explain your idea in detail and then show the transition graph of the TM. An idea: Shifting the input string to the right, if there is a symbol b before an a, stop shifting and move that b to the end of the string. This operation repeats until it sees no b to the left of an a.(See the illustration in Figure (a).) In Figure (b), the machine enters in state 3 if it sees an a after reading b ’s. a a b a b b a a b a a a b b a a b b a a a b a a b b b a a a a a b b b b accept Figure (a). Shifting the string and transposing b’s. Figure (b). State transition graph (b, B, R) (a, B, R) (a, a, R) (a, a, R), (b, b, R) (b, a, R) (b, b, R) 5 (B, b, N) (a, a, R) (B, b, L) 4 (a, a, L), (b, b, L) (B, B, R) start Put b at the end. Go for next iteration. This is an a out of order (B, a, N)