Profile Activity

Mr. Sigma.

Meta user

Network profile

Reputation

1,136

1.1k
1k
901

Top tag

algorithms

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Next badge

20/30

Impact

8 posts edited

1 helpful flag

133 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

33 Favorites

Added Views Newest Activity Votes

votes

answers

views

DCFL with prefix property have LR(0) grammar?

Dec 25 at 9:27 user113653 1

votes

answers

268

views

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

formal-languages automata context-free pushdown-automata

Oct 28 at 17:47 xskxzr 5,796

votes

answer

869

views

Difference between Lamport timestamps and Vector clocks

distributed-systems synchronization

Jun 21 at 14:05 Carmine 31

votes

answers

505

views

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

context-free formal-grammars ambiguity

Apr 14 at 11:16 Yo-yo man 1

votes

answers

17k

views

Solving or approximating recurrence relations for sequences of numbers

asymptotics proof-techniques combinatorics recurrence-relation reference-question

Mar 22 at 17:44 ryan 3,888

votes

answer

28k

views

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

computability turing-machines automata pushdown-automata

Feb 18 '19 at 15:33 Raphael♦ 66.8k

votes

answer

views

Two's complement general formula

binary numeral-representations

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

votes

answers

368

views

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

automata regular-languages finite-automata

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

votes

answers

285

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. 20.2k

votes

answers

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

vote

answer

views

Run-time of Sorting Algorithm

runtime-analysis sorting

Oct 13 '18 at 1:56 Community♦ 1

votes

answers

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,011

votes

answers

views

What exactly is a logic?

logic mathematical-foundations

Mar 31 '18 at 9:23 Boris E. 453

votes

answers

946

views

Is the intersection of infinitely many recursive sets recursive?

computability sets

Feb 14 '18 at 3:15 Community♦ 1

votes

answer

230

views

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

time-complexity quicksort

Feb 7 '18 at 13:53 gnasher729 16.5k

vote

answers

470

views

Number of ways to make $n$ cents

recurrence-relation

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

votes

answer

views

Number of conflict serializable schedules

concurrency database-theory

Jan 21 '18 at 14:49 virmis_007 97

votes

answer

views

What is the difference between RAM and TM?

turing-machines computation-models

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

vote

answer

685

views

How to calculate the complexity of a TM?

complexity-theory turing-machines

Jan 3 '18 at 8:53 quicksort 3,932

votes

answers

views

Relationship between Independent Set and Vertex Cover

graphs np-complete

Dec 29 '17 at 7:02 Jyotirmoy Pramanik 169

votes

answers

11k

views

Sliding window protocol, calculation of sequence number bits

computer-networks

Dec 16 '17 at 14:26 Prateek 456

votes

answers

views

Are there any non-finite automata?

automata finite-automata

Dec 10 '17 at 9:51 Community♦ 1

votes

answers

views

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

algorithms algorithm-analysis runtime-analysis

Dec 1 '17 at 6:51 clemens 362

vote

answer

views

T(n/3) + log(n)

asymptotics recurrence-relation

Nov 29 '17 at 17:10 Nicola Mela 1

votes

answers

views

Are there any countable sets that are not computably enumerable?

computability semi-decidability

Sep 23 '17 at 21:33 kasperd 203

votes

answer

515

views

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

mathematical-foundations

Aug 30 '17 at 2:51 jmite 25.9k

votes

answer

650

views

Bounded waiting and starvation free in critical section problem

operating-systems synchronization deadlocks critical-section

Mar 18 '17 at 18:55 Community♦ 1

votes

answers

views

Worst case $O(n \ln n)$ in place stable sort?

algorithms reference-request sorting in-place

Mar 9 '17 at 6:15 quintopia 176

votes

answer

views

How to satisfy bounded waiting in case of deadlock?

operating-systems deadlocks

Feb 2 '17 at 16:47 Community♦ 1

votes

answers

15k

views

How to show that a function is not computable?

computability proof-techniques undecidability reference-question

Nov 14 '15 at 19:28 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

33 Favorites

DCFL with prefix property have LR(0) grammar?

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

Difference between Lamport timestamps and Vector clocks

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

Solving or approximating recurrence relations for sequences of numbers

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

Two's complement general formula

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

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

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

Run-time of Sorting Algorithm

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

What exactly is a logic?

Is the intersection of infinitely many recursive sets recursive?

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

Number of ways to make $n$ cents

Number of conflict serializable schedules

What is the difference between RAM and TM?

How to calculate the complexity of a TM?

Relationship between Independent Set and Vertex Cover

Sliding window protocol, calculation of sequence number bits

Are there any non-finite automata?

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

T(n/3) + log(n)

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

Worst case $O(n \ln n)$ in place stable sort?

How to satisfy bounded waiting in case of deadlock?

How to show that a function is not computable?