User Mr. Sigma.

5

votes

2

answers

587

views

Constructive proof to show the quotient of two regular languages is regular

Dec 25 '18 at 23:19 Hendrik Jan 24.7k

3

votes

1

answer

3k

views

Difference between Lamport timestamps and Vector clocks

distributed-systems synchronization

Jun 21 '19 at 14:05 Carmine 31

8

votes

2

answers

749

views

Why do DFAs with a single final state have less power?

automata finite-automata computation-models

Dec 7 '18 at 17:24 John L. 24.8k

2

votes

1

answer

120

views

Two's complement general formula

binary numeral-representations

Dec 29 '18 at 12:27 dkaeae 4,799

1

vote

1

answer

77

views

Run-time of Sorting Algorithm

runtime-analysis sorting

Oct 13 '18 at 1:56 Community♦ 1

32

votes

3

answers

4k

views

Will hardware/implementation affect the time/space complexity of algorithms?

algorithms algorithm-analysis data-structures runtime-analysis

Jun 22 '18 at 17:19 nalzok 1,051

39

votes

3

answers

6k

views

What exactly is a logic?

logic mathematical-foundations

Mar 31 '18 at 9:23 Boris 483

8

votes

2

answers

306

views

Is {a^n (a+b)^n | n>0} a Deterministic CFL?

formal-languages automata context-free pushdown-automata

Oct 28 '19 at 17:47 xskxzr 6,539

7

votes

2

answers

1k

views

Is the intersection of infinitely many recursive sets recursive?

computability sets

Feb 14 '18 at 3:15 Community♦ 1

1

vote

2

answers

704

views

Number of ways to make $n$ cents

recurrence-relation

Feb 7 '18 at 13:20 Yuval Filmus 246k

2

votes

1

answer

287

views

Can quick sort time complexity be $\Theta(n\sqrt n)$ for some inputs?

time-complexity quicksort

Feb 7 '18 at 13:53 gnasher729 21.5k

1

vote

1

answer

1k

views

How to calculate the complexity of a TM?

complexity-theory turing-machines

Jan 3 '18 at 8:53 quicksort 4,042

4

votes

1

answer

2k

views

Number of conflict serializable schedules

concurrency database-theory

Jan 21 '18 at 14:49 Community♦ 1

36

votes

8

answers

9k

views

Are there any non-finite automata?

automata finite-automata

Jul 6 at 22:23 reinierpost 4,015

17

votes

4

answers

10k

views

Why don't we use quick sort on a linked list?

algorithms algorithm-analysis sorting quicksort

Nov 22 '18 at 23:37 Mariusz 1

5

votes

4

answers

2k

views

Is there really a $ O(1/n) $ algorithm?

algorithms algorithm-analysis runtime-analysis

Dec 1 '17 at 6:51 clemens 372

3

votes

2

answers

650

views

How to check for ambiguous grammar if you don't know the string

context-free formal-grammars ambiguity

Apr 14 '19 at 11:16 Yo-yo man 1

15

votes

3

answers

4k

views

Are there any countable sets that are not computably enumerable?

computability semi-decidability

Sep 23 '17 at 21:33 kasperd 203

15

votes

1

answer

540

views

Mathematics topics or fields that increase computer programming proficiency? [closed]

mathematical-foundations

Aug 30 '17 at 2:51 jmite 28.2k

7

votes

2

answers

1k

views

Bounded waiting and starvation free in critical section problem

operating-systems synchronization deadlocks critical-section

Sep 11 at 0:58 xskxzr 6,539

7

votes

2

answers

2k

views

DCFL with prefix property have LR(0) grammar?

formal-languages context-free lr-k

Dec 25 '19 at 9:27 Community♦ 1

4

votes

1

answer

3k

views

How to satisfy bounded waiting in case of deadlock?

operating-systems deadlocks

May 5 at 8:47 mb14 1

3

votes

1

answer

1k

views

Unambiguous but nondeterministic context-free language?

context-free

May 23 '15 at 20:35 Community♦ 1

13

votes

3

answers

1k

views

Is Deciding Decidability Decidable?

computability undecidability decision-problem

May 6 '15 at 23:30 Hendrik Jan 24.7k

1

vote

1

answer

2k

views

T(n/3) + log(n)

asymptotics recurrence-relation

Nov 29 '17 at 17:10 Nicola Mela 1

6

votes

2

answers

10k

views

Relationship between Independent Set and Vertex Cover

graphs np-complete

Dec 29 '17 at 7:02 Jyotirmoy Pramanik 177

11

votes

1

answer

5k

views

What is the difference between RAM and TM?

turing-machines computation-models

Jan 7 '18 at 22:51 Rodrigo de Azevedo 814

3

votes

3

answers

13k

views

Sliding window protocol, calculation of sequence number bits

computer-networks

Dec 16 '17 at 14:26 Community♦ 1

44

votes

2

answers

17k

views

How to show that a function is not computable?

computability proof-techniques undecidability reference-question

Nov 14 '15 at 19:28 Community♦ 1

49

votes

2

answers

34k

views

Is a push-down automaton with two stacks equivalent to a turing machine?

computability turing-machines automata pushdown-automata

Mar 6 '20 at 15:23 Yanior Weg 121

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

33 Bookmarks

Constructive proof to show the quotient of two regular languages is regular

Difference between Lamport timestamps and Vector clocks

Why do DFAs with a single final state have less power?

Two's complement general formula

Run-time of Sorting Algorithm

Will hardware/implementation affect the time/space complexity of algorithms?

What exactly is a logic?

Is {a^n (a+b)^n | n>0} a Deterministic CFL?

Is the intersection of infinitely many recursive sets recursive?

Number of ways to make $n$ cents

Can quick sort time complexity be $\Theta(n\sqrt n)$ for some inputs?

How to calculate the complexity of a TM?

Number of conflict serializable schedules

Are there any non-finite automata?

Why don't we use quick sort on a linked list?

Is there really a $ O(1/n) $ algorithm?

How to check for ambiguous grammar if you don't know the string

Are there any countable sets that are not computably enumerable?

Mathematics topics or fields that increase computer programming proficiency? [closed]

Bounded waiting and starvation free in critical section problem

DCFL with prefix property have LR(0) grammar?

How to satisfy bounded waiting in case of deadlock?

Unambiguous but nondeterministic context-free language?

Is Deciding Decidability Decidable?

T(n/3) + log(n)

Relationship between Independent Set and Vertex Cover

What is the difference between RAM and TM?

Sliding window protocol, calculation of sequence number bits

How to show that a function is not computable?

Is a push-down automaton with two stacks equivalent to a turing machine?