COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
R
|
|
|
|
|
|
R.
|
|
|
None
|
Detailed explanation-1: -Concatenation of R with outputs:a) Rb) c) R. d) None of the mentionedView AnswerAnswer: bExplanation: By distributive property (Regular expression identities), we can prove thegiven identity to be .
Detailed explanation-2: -Concatenation: If R1 and R2 are regular expressions, then R1R2 (also written as R1. R2) is also a regular expression. L(R1R2) = L(R1) concatenated with L(R2). Kleene closure: If R1 is a regular expression, then R1* (the Kleene closure of R1) is also a regular expression.
Detailed explanation-3: -If is an alphabet then ∗ is the set of strings over . For example, if is 0, 1 then ∗ is the set of binary sequences. • The length of a string is the number of symbol occurrences in it. The length of 01101 is 5.
Detailed explanation-4: -Concatenation signifies that the operands are to be joined in such a way that the last character, bit, graphic, or widechar of the operand to the left immediately precedes the first character, bit, graphic, or widechar of the operand to the right, with nothing intervening.