Category: Uncategorized

Problem Detail: I am going to attempt to write a random number generator using exisiting randomize algorithms. Can you suggest which algorithm has the biggest sequence that never repeats? I don’t care if they are fast or slow. Asked By : Piotr Read More …

Problem Detail: I am contemplating the Church-Rosser property and I clearly misunderstand it, but I do not exactly know why. If $x$ and $y$ are such that $x overset{*}{leftrightarrow} y$, then $x overset{*}{rightarrow} y$ and since $y overset{*}{rightarrow} y$, we have Read More …

Problem Detail: Given a universe $U$ consisting of k sets of vectors with each vector $vec{v} in {mathbb{F}_{p^m}}^n $. Given also another vector $vec{c} in {mathbb{F}_{p^m}}^n$. Now decide if there is a set $X$ with $|X| = |U|$ and $X_i in Read More …

Problem Detail: There are two stacks A and B. A : a,b,c,d (‘a’ is on top and ‘d’ is at the bottom of the stack) B : (empty) There are two rules. If an element of A is popped, it must Read More …

Problem Detail: I’m working on old multiple choice exams and would like to know if the following statements are true or false: a) $L_1 le_p L_2 le_p L_3 Rightarrow L_1 le_p L_3$ b) If $L in mathsf{NP}$ and $U le_p L$ Read More …

Problem Detail: I’ve been trying to implement Brzozowski’s algorithm but I’ve just discovered that it creates suboptimal automata for a certain class of inputs, having one more state than what is really needed in the result. I can show it on Read More …

Problem Detail: Let $mathrm{MIN}_{mathrm{DFA}}$ collection of all the codings of DFAs such that they are minimal regarding their states number. I mean if $langle A rangle in mathrm{MIN}_{mathrm{DFA}}$ then for every other DFA $B$ with less states than $A$, $L(A)ne L(B)$ Read More …

Problem Detail: I want to find a context-free grammar for $L = {a^n : nleq2^{20}}$. There’s one for sure. I approached it by two ways and both seemed dead end. One was to set a limit during the production of the Read More …

Problem Detail: I’m looking for a type inference algorithm for a language I’m developing, but I couldn’t find one that suits my needs because they usually are either: à la Haskell, with polymorphism but no ad-hoc overloading à la C++ (auto) Read More …

Problem Detail: In all the books, packets of slides and similar I read, cache miss is always explained by assuming that blocks of different caches (or cache and RAM) are always of the same size. It’s pretty clear how it’s works Read More …