Question 8823 – Digital-Logic-Design
May 17, 2024Question 6182 – UGC NET CS 2007-Dec-Paper-2
May 17, 2024UGC NET CS 2007-Dec-Paper-2
|
Question 5
|
Consider a Moore machine M whose digraph is :
Then L(M), the language accepted by the machine M, is the set of all strings having :
Then L(M), the language accepted by the machine M, is the set of all strings having :
|
two or more b’s.
|
|
|
three or more b’s.
|
|
|
two or more a’s.
|
|
|
three or more a’s.
|
Question 5 Explanation:
In the given state diagram it can be clearly noticed that the minimum string that is accepted by the moore machine M is “bb”. So the language can contain 0 or more number of a’s and 2 or more number of b’s.
Correct Answer: A
Question 5 Explanation:
In the given state diagram it can be clearly noticed that the minimum string that is accepted by the moore machine M is “bb”. So the language can contain 0 or more number of a’s and 2 or more number of b’s.
Subscribe
Login
0 Comments