edited by
551 views

1 Answer

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
1,448 views
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 :two or more b’sthree or more b’s...
2 votes
2 votes
1 answer
2
1 votes
1 votes
2 answers
3
go_editor asked Mar 28, 2020
1,249 views
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
0 votes
0 votes
1 answer
4
go_editor asked Mar 28, 2020
567 views
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to :the maximum weight of a non zero code wordthe minimum weight of a non zero code wordmn