Home /
Expert Answers /
Computer Science /
problem-3-4-points-give-a-right-linear-grammar-and-left-linear-grammar-for-the-following-languag-pa667
(Solved): Problem 3 (4 points) Give a right-linear grammar and left-linear grammar for the following languag ...
Problem 3 (4 points) Give a right-linear grammar and left-linear grammar for the following language: \[ \left\{a a b^{n} a b^{2 m} a: n \geq 2, m \geq 1\right\} \] Problem 4 (4 points) Find a regular expression for the language accepted by the following automata. What is the language accepted by this NFA?
Expert Answer
ANSWER: 1). 2). Argue that the language: L= { anb2n:n?0} is not regular. The language L ={anb2n:n>=0 } is not regular such that: To show L is not regular ,first for all N>0 we need to choose a str