Irasutomfhh

Oct 21, 19 · In circle A, ∠BAE ≅ ∠DAE Circle A is shown Line segments A B, A E, and A D are radii Lines are drawn from point B to point E and from point E to point D to form secants B E and E D Angles B A E and E A D are congruentI, j, k ≥ 1}, every string of 'a', 'b' and 'c' have certain number of a's, then certain number of b's and then certain number of c's The condition is that count of each of these 3 symbols should be atleast 1 'a' and 'b' can have thereafter be as many but count of c is equal to theK > 0 Per (c), we can take i = 0 and the resulting string will still be in L Thus, xy0z should be in L xy0z = xz = 0(p k)10p But, this is clearly not in L This is a contradiction with the pumping lemma Therefore our assumption that L is regular is incorrect, and L is not a regular language b L = fwtw jw;t 2f0;1gg Answer Universi I Dijes Home Facebook L nj news