Skip to main content
Nathaniel's user avatar
Nathaniel's user avatar
Nathaniel's user avatar
Nathaniel
  • Member for 6 years, 11 months
  • Last seen this week
  • Paris, France
2 votes
Accepted

Every DFA accepting a finite language must contain a dead state?

2 votes
Accepted

What is the right name for a "map" data structure?

2 votes

Is the language regular A2 = {w1w2w3 | w1, w2, w3 ϵ {0, 1}* }? How to prove?

2 votes

Why there can't be two instances of a "reverse" program in the Halting problem?

2 votes

How to modify Dijkstra's algorithm to model the path of an electric car?

2 votes
Accepted

Repeated Substring Pattern

2 votes
Accepted

Big O notation of $O(n/(m-n))$

2 votes

Turing Machine language, Undecidable, reductions

2 votes

Recursive formula for height of BST

2 votes
Accepted

Algorithm to select a random bit string with constraints

2 votes
Accepted

Independent set problem for graphs with very large independent sets

2 votes

What remains after removing leaves and roots from a directed graph?

2 votes

Greedy algorithm-maximal minimum average of n pairs

2 votes

Context Free Grammar Advantages

2 votes
Accepted

if X is in NP but Y is not in NP then can X be reduced to Y?

2 votes
Accepted

4DM is NP-complete

2 votes

Finding a solution vs Proving that a solution exists

2 votes

What is the complexity class of counting Yes/No instances of an NP problem?

2 votes

Subgraph Isomorphism Problem NP complete?

2 votes
Accepted

Randomly generated binary search trees case comparison

2 votes

Intersection of CFL and DCFL

2 votes
Accepted

Is there an efficient way to solve this problem?

2 votes

can you find an algorithm for this function?

2 votes
Accepted

Equivallent characterization of trees?

2 votes

In NP-hardness, can any category reduce to itself? How can you intuitively explain which categories reduce to the others?

2 votes
Accepted

What is the name of the complexity class for the optimization version of co-NP-complete and coNexpTime-complete problems?

2 votes
Accepted

Why the Following Grammars Are Not in CNF

2 votes

Max cut 2-approximation algorithm

2 votes

Is this a valid AVL tree?

2 votes

How can I estimate the time and cost (in relation to the machine and vocabulary) to enumerate sentences of English of n words?

1
3 4
5
6 7
17