Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

-1 votes
0 answers
34 views

How does depths of nodes change after left-rotation in a BST (Exercise qustion from Cormen)

-1 votes
1 answer
63 views

Removing left recursion with terminals only

-1 votes
1 answer
14 views

Why does adding an $ \epsilon $-transition to a DFA or NFA preserve the regularity of the language?

1 vote
0 answers
39 views

is there a TM $T(m;n)=q$ where $\forall m \forall n \exists q\space U(q;0)=U(m;n)$?

-1 votes
0 answers
16 views

unitary transformation without two matrix multiplications

1 vote
2 answers
48 views

Algorithm for coherent motion. Which bus is app user on?

-1 votes
0 answers
43 views

Implementing Generalized LL parsing from the Scott 2010 paper

-3 votes
0 answers
23 views

KNN algorithm definition

1 vote
1 answer
64 views

When is a max heap tree invariant under a root removal, followed by a re-insertion of the root?

-1 votes
0 answers
12 views

How is it q-learning what they do in Deep Learning and the Game of Go?

-1 votes
1 answer
45 views

Converting a Directed Acyclic Graph to a Directed Tree

-1 votes
1 answer
18 views

How to Implement Static Dictionary Compression?

-1 votes
0 answers
21 views

Can the leaf nodes of a parse tree be labeled by a variable, a terminal, and the empty symbol; or only a terminal and the empty symbol?

-1 votes
0 answers
23 views

Exact use case of drawing a finite state machine in kmp algorithm

Browse more Questions