RajS's user avatar
RajS's user avatar
RajS's user avatar
RajS
  • Member for 7 years, 11 months
  • Last seen more than 1 year ago
12 votes
1 answer
61k views

Solving T(n) = 2T(n/2) + log n with the recurrence tree method

8 votes
1 answer
31k views

Understanding denormalized numbers in floating point representation

5 votes
1 answer
128 views

Trick/insight to I implement given boolean function with minimum numbers of given gate

5 votes
1 answer
16k views

Understanding trap and dead state in automata

4 votes
1 answer
3k views

Understanding application of Arden's theorem to find regular expression

4 votes
1 answer
5k views

Minimum number of states in dfa accepting binary number with decimal equivalent divisible by $n$

4 votes
1 answer
265 views

What to infer about maximum height of AVL tree from these three different formulae

4 votes
1 answer
2k views

What is handle in bottom up LR parsing?

3 votes
1 answer
4k views

Difference between regular language and context free language

3 votes
1 answer
10k views

Overflow rule in two's complement arithmetic

3 votes
1 answer
646 views

Connection between non determinism and LL(1) conflicts

3 votes
2 answers
711 views

Arithmetic of asymptotic functions

3 votes
1 answer
2k views

Recognizable vs co-recognizable languages

2 votes
1 answer
5k views

Is it decidable "Given a TM M, whether M ever writes a non blank symbol when started on the empty tape."

2 votes
1 answer
3k views

Proving set of finite languages vs all languages over finite alphabet to be countable / uncountable

2 votes
1 answer
51 views

How does $LL(n)$ languages compare with $LR(0)$, for $n>0$?

2 votes
0 answers
2k views

Empty string in language with grammar in Chomsky normal form

2 votes
1 answer
694 views

Understanding connection between length of codeword and hamming distance in Hamming code

2 votes
0 answers
92 views

Are these two definitions of 2NF database normal form equivalent?

2 votes
1 answer
168 views

How reducing languages work?

2 votes
0 answers
2k views

How to build a TM state diagram for a given language

2 votes
1 answer
434 views

Understanding CLRS BFT lemma

2 votes
4 answers
8k views

DFA accepting strings with at least three occurrences of three consecutive 1's

2 votes
0 answers
880 views

Understanding definitions of Deterministic Context Free Grammar and Deterministic Pushdown Automaata

2 votes
2 answers
1k views

Existence of one and two state PDAs

2 votes
1 answer
3k views

Finding missing edge weights in the context of minimum spanning tree

2 votes
0 answers
410 views

Does SLR(0), LALR(0) exists?

2 votes
1 answer
2k views

In what sense a type of parser is less power than the other?

2 votes
1 answer
2k views

When will SLR(1) parser fail but CLR(1) will not

2 votes
0 answers
40 views

Does this state certify to be called as a deadlock?