Computer Science Stack Exchange

0

votes

0

answers

3

views

Building Memory from memory modules

memory-hardware

asked 24 mins ago Susmit Agrawal 101

2

votes

4

answers

644

views

Proof that total computable functions are not enumerable

computability semi-decidability enumeration

modified 1 hour ago xskxzr 6,539

1

vote

1

answer

10

views

Solving largely monotone SAT formulas

satisfiability sat-solvers

answered 1 hour ago Simon 131

0

votes

2

answers

29

views

Linked allocation in operating systems: why not use a doubly linked list?

filesystems

answered 1 hour ago Simon 131

1

vote

0

answers

6

views

Find dominated or subsumed linear inequalities efficiently

search-algorithms probabilistic-algorithms bloom-filters

asked 2 hours ago Simon 131

0

votes

1

answer

15

views

Operations with Asymptotic Notations

time-complexity asymptotics big-o-notation

modified 2 hours ago plop 668

0

votes

1

answer

31

views

Inference and Unification algorithm provided to a Unification graph of two expressions

compilers type-inference unification

modified 2 hours ago Community♦ 1

1

vote

1

answer

44

views

Construct regular expression that contains the substring

automata finite-automata regular-expressions

modified 3 hours ago Community♦ 1

3

votes

3

answers

4k

views

Bellman-Ford and zero-distance cycle

algorithms graphs shortest-path

modified 4 hours ago Inuyasha Yagami 748

1

vote

2

answers

119

views

is there a constructive proof of the existence of a language which isn't recursive (without invoking infinities)?

turing-machines semi-decidability

modified 4 hours ago Andrej Bauer 26.2k

11

votes

1

answer

2k

views

Hardness of a problem which is the sum of two NP-Hard problems

complexity-theory time-complexity np-complete np-hard

modified 4 hours ago D.W.♦ 128k

0

votes

0

answers

11

views

Formal Binary String Regular Expression (each pair of 00 must have 11 before it)

formal-languages regular-languages regular-expressions

asked 4 hours ago Rolodecks 103

0

votes

0

answers

20

views

Context-free grammar for the language $\{a^{n} b^{2n+1} c^{n} a^{n-1} \mid n \ge 2\}$

formal-languages context-free formal-grammars

modified 5 hours ago Yuval Filmus 242k

0

votes

2

answers

67

views

Determine if the language of words with same number of 1's and 2's is context-free or not

finite-automata context-free

modified 6 hours ago Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Building Memory from memory modules

Proof that total computable functions are not enumerable

Solving largely monotone SAT formulas

Linked allocation in operating systems: why not use a doubly linked list?

Find dominated or subsumed linear inequalities efficiently

Operations with Asymptotic Notations

Inference and Unification algorithm provided to a Unification graph of two expressions

Construct regular expression that contains the substring

Bellman-Ford and zero-distance cycle

is there a constructive proof of the existence of a language which isn't recursive (without invoking infinities)?

Hardness of a problem which is the sum of two NP-Hard problems

Formal Binary String Regular Expression (each pair of 00 must have 11 before it)

Context-free grammar for the language $\{a^{n} b^{2n+1} c^{n} a^{n-1} \mid n \ge 2\}$

Determine if the language of words with same number of 1's and 2's is context-free or not

Hot Network Questions