Register
Filter

Recent activity by anas_2908

2 answers
1
number of spanning tree
Consider a complete bipartite graph with ‘m’ and ‘n’ vertices. If m = 4, n = 4, then the number of spanning trees of graph are ________.
Consider a complete bipartite graph with ‘m’ and ‘n’ vertices. If m = 4, n = 4, then the number of spanning trees of graph are ________.
1 answer
3
DPDA (Empty Stack vs Final State)
" DPDA acceptance with empty stack" & " DPDA acceptance with Final State" are not equivalent. Comment on their dissimilarities & why they are not equivalent ?
" DPDA acceptance with empty stack" & " DPDA acceptance with Final State" are not equivalent. Comment on their dissimilarities & why they are not equivalent ?