Skip to main content
wece's user avatar
wece's user avatar
wece's user avatar
wece
  • Member for 11 years, 2 months
  • Last seen more than a month ago
8 votes

If X is independent to Y and Z, does it imply that X is independent to YZ ?

7 votes

When stating a theorem in textbook, use the word "For all" or "Let"?

6 votes
Accepted

Is the set of regular languages closed under set difference?

6 votes
Accepted

Can $|-x^2| < 1 $ imply that $-1<x<1$?

6 votes
Accepted

Intersection / Union of two regular expressions

5 votes

Is regular following language?

4 votes

3-regular graph and two-way Euler circuit

4 votes

When is an Integer a Rational Number, and are All Ratios Rational, Even $\frac{\sqrt{7}}{2}$?

4 votes
Accepted

Prove that the vertex degree of a minimum spanning tree is in $\mathcal{O}(1)$

3 votes

When existential quantifiers distribute over conjunction

3 votes

Probability of a particular randomly generated tree shape?

3 votes
Accepted

Do all logics have formula syntax specified by context-free grammar?

3 votes

To find maximum of the given formula

3 votes

mathematical induction; recursive definition of the set of all positive integers; $7^{2n+1} + 6^{n+2}$ divisible by $43$

3 votes
Accepted

Give an example of a language $L$ where $\min(\max L)\neq \max(\min L)$

3 votes
Accepted

Number of binary search tree of height $6$

2 votes

Regular Expressions with Repetition

2 votes

Random Walk on graph with five vertices

2 votes

The complement of a language of a machine L(M)

2 votes

Algorithm for the number of partitions of $n$ into distinct parts

2 votes
Accepted

(Possibly counting sort) Designing O(N+n) algorithm that sorts i sequences

2 votes
Accepted

Proving a greedy algorithm for pairing people.

2 votes
Accepted

Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.

2 votes
Accepted

Prove that for every planar graph, there is a partition $V = V_1 \cup V_2 \cup V_3$ such that the graphs with those are acyclic

2 votes
Accepted

PDA and Some language Grammar inference

2 votes

Given an optimal solution to the LP, show how it can be used to construct a directed cycle with minimal directed cycle mean cost.

2 votes

Why are two base cases needed to prove that $n<2^n$ for all $n\geq 0\,$?

2 votes

Write grammar for given language

2 votes

Algorithm to find max no. of nodes that can be visited

2 votes

Labelled graph minor theorem

1
2 3 4 5