Q. Give a production grammar that specified language L = {ai b2i >= 1}

View solution

Q. Which of the following String can be obtained by the language L = {ai b2i / i >=1}

View solution

Q. The production Grammar is {S->aSbb, S->abb} is

View solution

Q. The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1)

View solution

Q. Non-Linear grammar has has two non-terminals on the right-hand side.

View solution

Q. Linear grammar has more than one non-terminal on the right-hand side.

View solution

Q. In Right-Linear grammars, all productions have the form: A → xB

View solution

Q. S → abS S → a is which grammar

View solution

Q. Which Grammar is it?

View solution

Q. Which Type of Grammar is it?
S → Aa A → Aab | λ

View solution

Q. A Regular Grammar is any right-linear or left-linear grammar.

View solution

Q. Regular Grammars generate Regular Languages.

View solution

Q. Can Left Linear grammar be converted to Right Linear grammar

View solution

Q. A Push Down Automata is if there is at most one transition applicable to each configuration?

View solution