edited by
235 views
2 votes
2 votes

here all are non regular grammar how we can identify regular language.

if i solve by this way than i think all are regular

please correct me if i wrong

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
pream sagar asked Sep 24, 2018
200 views
L=anbmcndmthere are two conditionCondition 1-if m>n then PDA isCondition 2-if m<n then PDA iscombine Condition 1 and Condition 2then L=anbmcndm is CFL rather then DCF...
0 votes
0 votes
1 answer
2
pream sagar asked Sep 23, 2018
201 views
what is the difference between denumerable , enumerable , countable.please explain I confused with this term when i see some theorem "Power set of an infinite set(denum...
0 votes
0 votes
0 answers
4
sreenivas.s1995 asked Jan 31, 2019
350 views
Does increasing number of threads decrease total waiting time of the process in terms of round robin scheduling or does it remain the same?Can you please explain why