Register
Filter

Answers by rballiwal

0 votes
1
#GRAPH THEORY
A simple regular graph n vertices and 24 edges, find all possible values of n.
A simple regular graph n vertices and 24 edges, find all possible values of n.
1 votes
2
self doubt
What is the general formula for number of simple graph having n unlabelled vertices ??
What is the general formula for number of simple graph having n unlabelled vertices ??
1 votes
3
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
What is the probability that there is an edge in an undirected random graph having 8 vertices?1 1/8
0 votes
5
regular expression for mod 3 =1
someone can help me found the regular expression of L={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
someone can help me found the regular expression ofL={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
2 votes
6
DFA doubt
let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n? a)1 b)2 c)3 d)4 e)there not fixed
let M be a DFA {a,b} with exactly 2 state .Suppose further that M accepts a finite number n of distinct words .what is the maximum value of n?a)1b)2c)3d)4e)there not fixe...
0 votes
9
Self doubt
Unrestricted grammar generate Recursive enumerable language. Am i right??
Unrestricted grammar generate Recursive enumerable language.Am i right??
0 votes
12
Question on P problem
I think answer should be D. they have given wrong answer. Please correct me if I am wrong.
I think answer should be D. they have given wrong answer.Please correct me if I am wrong.
0 votes
14
pushdown automata
What is the difference between DPDA which accept Language by the empty stack and the one which accepts by final state
What is the difference between DPDA which accept Language by the empty stack and the one which accepts by final state
0 votes
16
Turing Machine lecture content stan..
A = { <M,w> | M is a TM that accepts W} what is A’( A complement)? Pls guide : M is a Tm doesn,t accept w, Unable to approach further Source:https://web.stanford.edu/class/archive/cs/cs103/cs103.1134/lectures/20/Small20.pdf
A = { <M,w | M is a TM that accepts W}what is A’( A complement)? Pls guide : M is a Tm doesn,t accept w, Unable to approach further Source:https://web.stanford.edu/c...
0 votes
17
recursive language
Can a language exist which is undecidable as well as Recursive language ? If yes please give example.
Can a language exist which is undecidable as well as Recursive language ? If yes please give example.
0 votes
18
Countable set
If power set of natural number is uncountable , and that is why non RE, then how is it possible set of natural number is countable and RE?------give some reason
If power set of natural number is uncountable , and that is why non RE,then how is it possible set of natural number is countable and RE? give some reason
0 votes
23
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
DFA in which 01 and 10 have equal number of occurrences
1 votes
24
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________.// doubt: minimal strin...
0 votes
25
ME Test Series
I know compleiment of CSL is CSL so can anyone explain how to solve these type of problems effectively by saving time.
I know compleiment of CSL is CSL so can anyone explain how to solve these type of problems effectively by saving time.
0 votes
26
ME Test Series
Can anyone explain?
Can anyone explain?
1 votes
28
Introduction to computer theory
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
Page: