0 votes 0 votes I am getting A,C and D but the answer given is A,C. Theory of Computation theory-of-computation + – Crackca asked Jan 5, 2022 Crackca 284 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply raja11sep commented Jan 5, 2022 reply Follow Share Equivalent Regular expression for both the grammar is (aa+bb)^+ So both the languages are regular and same language.Because language generated by a regular expression is unique.And every regular language is accepted by some Finite Automata. So C and D correct. Never studied linear language. You have some resources please share. Both the grammars are regular grammar so linear grammar as well. 1 votes 1 votes ankit3009 commented Jan 5, 2022 i reshown by ankit3009 Jan 5, 2022 reply Follow Share https://www.uobabylon.edu.iq/eprints/publication_11_13397_6032.pdf @raja11sep 1 votes 1 votes raja11sep commented Jan 5, 2022 reply Follow Share @ankit3009 thanks but this link is for what Ankit. Right linear, left linear grammar..and linear grammar..all these I know..But never studied linear language. If you have any resources regarding that then share. 0 votes 0 votes Crackca commented Jan 5, 2022 reply Follow Share https://planetmath.org/linearlanguage@raja11sepSo, My answer should be right. 1 votes 1 votes raja11sep commented Jan 5, 2022 reply Follow Share A langauge generated by a linear grammar is called a linear language. 0 votes 0 votes raja11sep commented Jan 5, 2022 reply Follow Share Thanks for the link. Yes A,C,D correct. 1 votes 1 votes Please log in or register to add a comment.