0 votes 0 votes Identify the type of the given language and draw the corresponding automata for the language. $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$ A] Regular B] DCFL C] CFL but not DCFL D] Non-CFL Please describe your selection. Theory of Computation regular-grammar context-free-grammar npda dpda theory-of-computation + – anupamsworld asked Sep 2, 2022 anupamsworld 538 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments anupamsworld commented Sep 3, 2022 reply Follow Share @abhinowKatore @ankitgupta.1729 answer given is option D Not sure where exactly I am going wrong but I was thinking the given language as $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=i \space\ or \space\ j=k \right \}$ Could you please correct why it is wrong to think like this. 0 votes 0 votes afroze commented Sep 3, 2022 reply Follow Share assume I=2, k=3 now j=2 according to your language bt wrt qsn it should be 3(max) 1 votes 1 votes shikhar500 commented Oct 20, 2022 reply Follow Share @ankitgupta.1729 can u prove this language non-cfl by other methods apart from pumping lemma ? 0 votes 0 votes Please log in or register to add a comment.