user avatar
user avatar
user avatar
Ashwin Ganesan
  • Member for 7 years, 11 months
  • Last seen this week
4 votes
Accepted

MST: Are all safe edges, light edges?

3 votes
Accepted

Prove that $\texttt{prefix}(L)$ is regular

3 votes

Can maximal number in poset be more than one?

3 votes
Accepted

Am I drawing the recursion trees correctly?

3 votes

Solving $T(n) = 2T(\lfloor{\frac{n}{2}}\rfloor) + n$ with substitution method

3 votes
Accepted

Formal Proof on why Greedy isn't working on one Particular Problem

2 votes
Accepted

Find the largest subset of unpaired elements

2 votes
Accepted

Logical consequence problem, doubt

2 votes

How does Sipser's proof that $0^n1^n$ is not regular work?

2 votes
Accepted

What exactly is pumping length in pumping lemma?

2 votes

Myhill–Nerode equivalence classes for the language $b^ia^{5j}$

2 votes

Proof of the inclusion-exclusion principle

2 votes
Accepted

AVL tree worst case height proof

2 votes

$L_1 ∩ L_2$ is not regular while $L_1$ is regular and $L_2$ is not regular language

2 votes

$2d+1$ threshold for error detection

1 vote

Useless production

1 vote
Accepted

Worst case runtime for binary search

1 vote

How to prove that this language is not regular?

1 vote

Prove or disprove - graph doesn't exists

1 vote

Wrong proof about maximum matching

1 vote

Difference between $a^{2n} b^n$ and $n_a(w) = 2n_b(w)$

1 vote

Repeated vertices in cycles (graph theory)

1 vote
Accepted

An exercise that asks for informal description of the language accepted by a specific PDA

1 vote

Finding a DFA for concatenation

1 vote

NFA to recognize the language ${ab}$

1 vote

Graph Injective-Homomorphism Problem

1 vote
Accepted

Complement of DFA always give the language which is complemented?

1 vote
Accepted

Averege time complexity of open addressing

1 vote

Why is a recurrence of $2N_{h-2}$ equal to $2^{h/2}$?

1 vote

Why is $a^{\log_b n}$ the same as $n^{\log_b a}$?