Computer Science Stack Exchange

-1 votes

0 answers

34 views

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

algorithms binary-search-trees

Esha

99

modified 44 mins ago

-1 votes

1 answer

63 views

Removing left recursion with terminals only

formal-grammars compilers left-recursion

CommunityBot

1

modified 1 hour ago

-1 votes

1 answer

14 views

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

automata finite-automata

Steven

23.4k

answered 2 hours ago

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)$?

turing-machines halting-problem

raoof

111

modified 5 hours ago

-1 votes

0 answers

16 views

unitary transformation without two matrix multiplications

matrices linear-algebra

poisonDartFrog

1

asked 5 hours ago

1 vote

2 answers

48 views

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

algorithms

CommunityBot

1

modified 6 hours ago

-1 votes

0 answers

43 views

Implementing Generalized LL parsing from the Scott 2010 paper

algorithms context-free parsers

Rahul Gopinath

315

modified 6 hours ago

-3 votes

0 answers

23 views

KNN algorithm definition

algorithms

Zhu Bajie

1

asked 6 hours ago

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?

trees binary-trees heaps

CommunityBot

1

modified 8 hours ago

-1 votes

0 answers

12 views

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

machine-learning

Fukai Mizumi

1

asked 9 hours ago

-1 votes

1 answer

45 views

Converting a Directed Acyclic Graph to a Directed Tree

graphs dag decomposition

Steven

23.4k

answered 9 hours ago

-1 votes

1 answer

18 views

How to Implement Static Dictionary Compression?

data-compression

Pseudonym

18.9k

answered 11 hours ago

-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?

formal-languages context-free formal-grammars

Masroor

335

modified 13 hours ago

-1 votes

0 answers

23 views

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

algorithms data-structures string-matching

jammy

99

asked 14 hours ago

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our questions

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

Removing left recursion with terminals only

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

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

unitary transformation without two matrix multiplications

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

Implementing Generalized LL parsing from the Scott 2010 paper

KNN algorithm definition

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

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

Converting a Directed Acyclic Graph to a Directed Tree

How to Implement Static Dictionary Compression?

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?

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

Hot Network Questions