As of May 31, 2023, we have updated our Code of Conduct.
Computer Science
John L.'s user avatar
John L.'s user avatar
John L.'s user avatar
John L.
  • Member for 4 years, 10 months
  • Last seen this week
  • Canada
Profile Activity

1,109 Answers

Score Activity Newest
33 votes

What is this data structure/concept where a plot of points defines a partition to a space

21 votes
Accepted

Are there variations of the regular runtimes of the Big-O-Notation?

21 votes
Accepted

Is the Berkeley tutorial on Fibonacci trees using wrong figures?

18 votes

Dynamic Programming vs Memoization

17 votes
Accepted

"Guess the number" Problem on Turing machines

17 votes
Accepted

How can you convince your colour-blind friend that two balls have the same colour?

16 votes
Accepted

Longest common substring in linear time

16 votes
Accepted

Can I use the following method to prove an algorithm is correct?

16 votes
Accepted

Prove that every substring closed language L ⊆ {0, 1}* is regular

15 votes
Accepted

Prove or Disprove: an infinite intersection of regular languages is a context-free language

14 votes
Accepted

Is a "local" version of 3-SAT NP-hard?

14 votes

Do any two spanning trees of a simple graph always have some common edges?

12 votes

Conjecture: a half of a pairing context-free language must be a regular language

11 votes

O(·) is not a function, so how can a function be equal to it?

11 votes
Accepted

Are all MST minimum spanning trees reachable by Kruskal and Prim?

11 votes
Accepted

Why is { w | |w| mod 3 = #_a(w) mod 3 } a Regular Language?

10 votes
Accepted

Divide and Conquer to identify a knight from n people

10 votes
Accepted

Can the diagonal language be empty?

9 votes

How to solve T(n)=2T(√n)+log n with the master theorem?

9 votes
Accepted

Aren’t most constraining variable and least constraining value the exact opposite?

9 votes
Accepted

Why do DFAs with a single final state have less power?

9 votes
Accepted

All superlinear runtime algorithms are asymptotically equivalent to convex function?

9 votes
Accepted

Does a binary code with length 6, size 32 and distance 2 exist?

9 votes
Accepted

Asymptotic of $\frac{(\sqrt{n}+n-1)!}{(\sqrt{n})!(n-1)!}$

9 votes
Accepted

What role is the set, S playing in Dijkstra's algorithm given in the book CLRS?

9 votes
Accepted

Why can't 3-SAT be solved efficiently if you convert all clauses (x ∨ y ∨ z) into (u ∨ z) by introducing a variable?

9 votes
Accepted

Does it make sense to call GAP a "procedural" language?

8 votes

How can you find all unbalanced parens in a string in linear time with constant memory?

8 votes
Accepted

How to prove the emptiness of intersection of two context free languages is undecidable?

8 votes

The first Turing machine

1
2 3 4 5
…
37

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.