The major difference between a moore and mealy machine is that
A. | output of the former depends on the present state and present input |
B. | output of the former depends only on the present state |
C. | output of former depends only on the present input |
D. | all of these |
Option: B Explanation : Click on Discuss to view users comments. |
Any given transition graph has an equivalent
A. | regular expression |
B. | DFSM |
C. | NDFSM |
D. | all of these |
Option: D Explanation : Click on Discuss to view users comments. |
For which of the following application, regular expressions cannot be used ?
A. | Designing computers |
B. | Designing compilers |
C. |
Both (a) and (b)
|
D. | Developing computers |
Option: D Explanation : Click on Discuss to view users comments. |
If S be an infinite set and be sets such that S1 ∪ S2 ∪ .....∪ SN = S, then
A. | atleast one of the set Si is a finite set
|
B. | not more than one of the sets Si can be finite |
C. | atleast one of the sets Si is an infinite set |
D. | not more than one of the sets Si can be infinite |
Option: C Explanation : Click on Discuss to view users comments. |