This account is temporarily suspended for voting irregularities. The suspension period ends on Sep 11 '22 at 22:21.

 14 Is $\{w_1xw_2\mid w_1,w_2\in \{a,b\}^* \text{ and } x \in \{a,b\}\}$ regular or not? 6 Why are Regular sets not closed under infinite unions and intersections? 5 What is the meaning of this symbol that looks like an inverted uppercase A? 5 Time Complexity of Logarithmic For loop 3 Examples of higher order algorithms ($\mathcal{O}(n^4)$ or larger)

### Reputation (1)

 +2 Checking validity of formulas in first-order logic +10 What is the asymptotic bound for $T(n)= 3T(\sqrt{n})+n^3$? +10 Difference between a regular and a non-regular language +10 In search of finding an idea that work in $o(n^3)$

### Questions (16)

 2 On counting number of vertices that have common neighbor 2 Minimize the sum of diameters of 2-clustering graph 2 Bellman-Ford algorithm and nodes that not appear on negative cycle 2 Lower bound 3-dimentional linear programming 1 In search of finding an idea that work in $o(n^3)$

### Tags (73)

 24 regular-languages × 8 9 complexity-theory × 5 17 formal-languages × 7 9 finite-automata × 4 14 asymptotics × 16 6 recurrence-relation × 7 13 time-complexity × 20 6 type-theory 10 algorithms × 25 5 notation

### Bookmarks (9)

 15 An efficient data structure supporting Insert, Delete, and MostFrequent 4 Shortest path including all nodes in a subset 4 Combinatorics - how many $c$-distinct sets are possible? 3 How can I solve $T(n) = 2T(\sqrt{n-1} + 2) + 1$ recurrence using tree method? 2 Given DAG $G(V,E)$, find $\forall v \in V$ the sum of the weights of vertices that are reachable from the $v$

### Accounts (5)

 Mathematics 135 rep 88 bronze badges Theoretical Computer Science 129 rep 88 bronze badges Stack Overflow 101 rep 11 bronze badge Meta Stack Exchange 101 rep 11 bronze badge Computer Science 1 rep 22 silver badges2222 bronze badges