Unformatted text preview: A so that A 1 3 = { x  for some yz,  x  = 1 3  xyz  and xyz ∈ A } Similarly, let A 3 3 be the set of all last thirds of strings in A so that A 3 3 = { z  for some xy,  z  = 1 3  xyz  and xyz ∈ A } Finally, let A 1 3 , 3 3 be the set of strings with their middle third deleted so that A 1 3 , 3 3 = { xz  for some y,  x  =  z  = 1 3  xyz  and xyz ∈ A } a. Give an automaton that recognizes A 1 3 or prove that is not regular. b. Give an automaton that recognizes A 3 3 or prove that is not regular. c. Give an automaton that recognizes A 1 3 , 3 3 or prove that is not regular. 1 Give the statetransition diagram of the automaton; don’t give a tuple. Page 1...
View
Full Document
 Spring '09
 EdmundM.Clarke
 Tuple, Formal language, Regular expression, Regular language, Chomsky hierarchy

Click to edit the document details