1 votes 1 votes Theory of Computation theory-of-computation regular-language context-free-language + – Sunil8860 asked Sep 4, 2017 Sunil8860 201 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Rishabh Gupta 2 commented Sep 4, 2017 reply Follow Share I think both are non regular since we have to count the number of a's and b's. 0 votes 0 votes joshi_nitish commented Sep 5, 2017 reply Follow Share @Rishabh Gupta 2 A is regular but B is non regular, because in A, you can expand 'y' such that it will consume value of x but in B this is not possible since $ symbol will not allow y to expand 0 votes 0 votes Rishabh Gupta 2 commented Sep 5, 2017 reply Follow Share @joshi_nitish I still don't get the idea. Can u please elaborate, may be post the dfa/nfa or the regular expression for A. 0 votes 0 votes Please log in or register to add a comment.
