Which Of The Following Is The Correct Representation Of Grammar #546
Which of the following is the correct representation of grammar for the given regular expression?<br /> a(aUb)*b
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Push Down Automata - DPDA and Context Free Languages - Quiz No.1.
Which of the following is the correct representation of grammar for the given regular expression?
a(aUb)*b
a(aUb)*b
using special symbols to stand for substrings of a particular structure
using rules to specify how the substrings are combined to form new substrings.
(1) S → aMb (2) M → e (3) M → aMb (4) M → bMa
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
