1 votes 1 votes Theory of Computation pushdown-automata theory-of-computation + – bahirNaik asked Jan 3, 2016 retagged Jul 4, 2017 by Arjun bahirNaik 718 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Sumit1311 commented Jan 3, 2016 reply Follow Share State with label "o" is dead state right? 0 votes 0 votes bahirNaik commented Jan 3, 2016 reply Follow Share yes o is dead state. 0 votes 0 votes Praveen Saini commented Jan 3, 2016 reply Follow Share Only $q_1$ is final state. Then language is only $a^+$. It means option D. (As for Given PDA) There are some possibilities of Typo's.1. If $q_1$ and $q_3$ are final states and I believe that it should be. Then $a^ib^jc^k$, where $i \neq j$ is correct. It means option A (look at possibilities to reach $q_3$, from $q_1$ directly , means there is no $b$, that is $i>j$ or to reach $q_3$ from $q_2 $, $b, Z_0/Z_0$ means $j>i$, or $\lambda, a/a$ means $i>j$. And $q_1$ is also final, means $i>j$ only. And on reading c, we are doing nothing, so nothing to do with $k$) 2.If $O$ is also final state (along with $q_1$ and $q_3$) then it will add $ \Sigma^*-a^*b^*c^*$ along with option A, then option C will be correct. 1 votes 1 votes Please log in or register to add a comment.