2022 Developer Survey is open! Take survey.
user avatar
user avatar
user avatar
jkff
  • Member for 9 years, 10 months
  • Last seen more than 1 year ago
44 votes
Accepted

Can regular languages be Turing complete?

41 votes

Is there a physical analogy to the Turing Machine?

17 votes

What is the point of finite automata?

8 votes
Accepted

How can one search in O(log n) time in a red-black tree?

8 votes

Is Dijkstras algorithm used in modern route-finding systems?

5 votes
Accepted

Data Structure for Representing a Math Expression

4 votes

How to construct a Turing machine for a language

4 votes
Accepted

Was there an attempt to make reusable regular expressions?

4 votes

Array-like immutable (persistent) data structure implementation with fast indexing, append, prepend, iteration

4 votes
Accepted

What is the difference between consensus and mutual exclusion in Distributed Systems?

3 votes
Accepted

How to interpret the execution of distributed computation from time-space diagram?

2 votes

How many combination of “n” bits are there in terms of n?

2 votes
Accepted

Is this language regular or non-regular: {ww : w ∈ {a,b}* }

2 votes
Accepted

Extra space of MergeSort

2 votes

Is there a complexity metric for finite state machines?

2 votes

Sums of all pairs: possible less than quadratic?

2 votes

How to interprocess communication and scheduling algorithms interact?

2 votes

Efficiently enumerate all subsets of an ordered set

1 vote
Accepted

Single Source Shortest Path: What does the weights on the vertex and edges tell you?

1 vote

Identity in the category of types and functions

1 vote

Divide and conquer algorithm to sort nk items in n lists that runs in O(nk*logn) time?

1 vote

Efficient representation of a given surjective function $\{1 \ldots N\} \rightarrow \{1 \ldots M\}$ when $N \gg M$

0 votes

Data structure to insert, update and sort indexes by frequency and query an index for a particular cumulative frequency