Question: Suppose is a regular expression in which the Kleene - star operation is NOT used. Of the following 5 statements, how many are TRUE about
Suppose is a regular expression in which the Kleenestar operation is NOT used. Of the following statements, how many are TRUE about the language represented by
is finite.
is regular.
is regular but infinite.
is infinite.
may be nonregular.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
