Find A Regular Expression For A Grammar Which Generates A #545
Find a regular expression for a grammar which generates a language which states :<br /> L contains a set of strings starting wth an a and ending with a b, with something in the middle.
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.
Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.
L contains a set of strings starting wth an a and ending with a b, with something in the middle.
a(a*Ub*)b
a*(aUb)b*
a(a*b*)b
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
