Question

Where can I learn more about the "else" operation / "else monoid"?

score 221 · Answer 1 · 2026-03-27 03:49:12

221

Views

Where can I learn more about the "else" operation / "else monoid"?

Published on 27 Mar 2026 - 3:49

score 47 · Answer 2 · 2015-04-19 18:08:17

47

Views

Elaboration needed on a section of a published paper about dictionary learning

Published on 19 Apr 2015 - 18:08

score 206 · Answer 3 · 2026-03-27 00:05:04

206

Views

Is $L = \{0^{i}1^{i}0^{j}1^{i} | i, j > 0\}$ a context free language?

Published on 27 Mar 2026 - 0:05

score 127 · Answer 4 · 2015-04-20 18:43:53

127

Views

Graphing digraphs with the following vertex set

Published on 20 Apr 2015 - 18:43

score 114 · Answer 5 · 2015-04-20 21:05:35

114

Views

(a) Given the graph below, for each pair of vertices given in (i) and (ii) gi

Published on 20 Apr 2015 - 21:05

score 166 · Answer 6 · 2015-04-20 21:48:15

166

Views

A doubly infinite tape Turing machine can simulate a ordinary Turing machine, a rigorous proof.

Published on 20 Apr 2015 - 21:48

score 1.1k · Answer 7 · 2015-04-21 02:29:04

1.1k

Views

Why can any values of C and N be chosen for the proof of Big-Oh?

Published on 21 Apr 2015 - 2:29

score 91 · Answer 8 · 2026-03-27 00:02:19

91

Views

Construct Context Free Grammar for $\{0,1\}^-\{www~|~w\in\{0,1\}^\}$

Published on 27 Mar 2026 - 0:02

score 69 · Answer 9 · 2026-03-27 15:05:15

69

Views

Computability: is there an alternative method to decide this language?

Published on 27 Mar 2026 - 15:05

score 173 · Answer 10 · 2026-03-29 10:27:46

173

Views

Prove a language isn't regular using Myhill-Nerode thm.

Published on 29 Mar 2026 - 10:27

score 64 · Answer 11 · 2015-04-22 01:41:48

64

Views

Determining the sequence that yields a balanced search tree in the form of a recurrence / sequence

Published on 22 Apr 2015 - 1:41

score 374 · Answer 12 · 2026-03-30 13:52:09

374

Views

Tree decomposition by hand for understanding

Published on 30 Mar 2026 - 13:52

score 15.4k · Answer 13 · 2026-03-27 17:34:09

15.4k

Views

Given the graph below, use Dijkstra’s algorithm to find the shortest path (More details included)

Published on 27 Mar 2026 - 17:34

score 2.5k · Answer 14 · 2015-04-23 15:46:28

2.5k

Views

Solving Recurrence Relations with Geometric Series

Published on 23 Apr 2015 - 15:46

score 117 · Answer 15 · 2026-03-30 11:54:25

117

Views

Prove that sets don't intersect

Published on 30 Mar 2026 - 11:54

List Question

Where can I learn more about the "else" operation / "else monoid"?

Elaboration needed on a section of a published paper about dictionary learning

Is $L = \{0^{i}1^{i}0^{j}1^{i} | i, j > 0\}$ a context free language?

Graphing digraphs with the following vertex set

(a) Given the graph below, for each pair of vertices given in (i) and (ii) gi

A doubly infinite tape Turing machine can simulate a ordinary Turing machine, a rigorous proof.

Why can any values of C and N be chosen for the proof of Big-Oh?

Construct Context Free Grammar for $\{0,1\}^-\{www~|~w\in\{0,1\}^\}$

Computability: is there an alternative method to decide this language?

Prove a language isn't regular using Myhill-Nerode thm.

Determining the sequence that yields a balanced search tree in the form of a recurrence / sequence

Tree decomposition by hand for understanding

Given the graph below, use Dijkstra’s algorithm to find the shortest path (More details included)

Solving Recurrence Relations with Geometric Series

Prove that sets don't intersect

Trending Questions

Popular # Hahtags

Popular Questions