Network profile

rsonx

Reputation

241

245
223
202

Jul
Oct
Jan
Apr

Top tag

automata

Next privilege

250 Rep.

View close votes

Badges

1

8

Newest

Curious

Next badge

0/1

Impact

0 posts edited

0 helpful flags

37 votes cast

13 Questions

Votes Activity Newest Views

1

vote

1

answer

46

views

Difficulty understanding the use of arbitrary function for the worst case running time of an algorithm

time-complexity

Aug 23 at 15:04 Yuval Filmus 249k

1

vote

1

answer

60

views

Worst case running time of lexicographical sorting of a list of n strings each of length n using merge sort

time-complexity asymptotics runtime-analysis mergesort

May 5 '20 at 20:11 John L. 25.5k

1

vote

1

answer

55

views

Can there be a language not Context free but still PDA acceptable?

context-free pushdown-automata

Jan 30 '20 at 22:44 vonbrand 12.7k

1

vote

1

answer

114

views

Why is $T(n)=3T(n/4) + n\log n$ solvable with Master Method but $T(n)=2T(n/2) + n\log n$ is not?

algorithm-analysis asymptotics runtime-analysis recurrence-relation

Dec 8 '19 at 8:08 Yuval Filmus 249k

1

1

vote

3

answers

73

views

How to mathematically prove that a relation T(n)=T($\sqrt{n}$)+c is O(log(log(n))?

algorithm-analysis time-complexity asymptotics runtime-analysis

Nov 1 '19 at 14:10 Yuval Filmus 249k

1

vote

1

answer

194

views

What is the importance of the condition “| xy | < p” in pumping lemma? [duplicate]

automata pumping-lemma

Mar 30 '19 at 20:21 David Richerby 78.7k

1

vote

2

answers

69

views

Why $\phi$ $\cdot$ R = $\phi$, rather than $\phi$ $\cdot$ R = R in Automata? [duplicate]

formal-languages automata formal-grammars

Mar 23 '19 at 11:44 David Richerby 78.7k

1

vote

0

answers

78

views

Can I say θ(g(n)) is the intersection of Ω(g(n)) and O(g(n))?

time-complexity asymptotics

Mar 21 '19 at 15:49 rsonx 241

1

vote

1

answer

54

views

Understanding the relations between O(g(n)), Θ(g(n)) and Ω(g(n)) [duplicate]

time-complexity asymptotics

Mar 21 '19 at 12:11 Yuval Filmus 249k

0

votes

2

answers

101

views

How is the set of functions from ${\{a,b\}}$ to $N$ countable?

discrete-mathematics sets counting uncountability

Jan 2 '20 at 5:06 Mars 601

0

votes

0

answers

269

views

How to find the minimum number of states of a deterministic finite automaton accepting a given language [duplicate]

formal-languages automata finite-automata

Apr 11 '19 at 9:21 rsonx 241

0

votes

1

answer

44

views

Is there a way to calculate the number of all the languages over an alphabet?

automata

Apr 1 '19 at 9:36 dkaeae 4,789

-2

votes

2

answers

78

views

How to correctly negate a predicate bounded by some quantifiers?

logic first-order-logic propositional-logic predicate-logic

Jan 13 at 6:54 real albert einstien 11

Computer Science Stack Exchange works best with JavaScript enabled