Blog

Problem Detail: I’m willing to take a course in formal languages and automata theory , where we will explore side by side a functional programming language to implement the different algorithms we will encounter ,despite i am new to the language Read More …

Problem Detail: I’m abit afraid to ask this question here seeing as I asked it on programmers SE already, the thing is I think the question is more about the underlying theory than the use in practice (or call it confirmation Read More …

Problem Detail: How to simulate a non-deterministic PDA with a turing machine? Asked By : odai Answered By : muratcakmak The sets of all languages that can be represented by a PDA is proper subset of the all languages that can be represented Read More …

Problem Detail: I apologize, but even after these two other posts: here and here I’m still having trouble understanding oracle TMs and relativization. This question comes at the issue from a different angle: Why are non-relativizing proofs considered more valid than Read More …

Problem Detail:  Possible Duplicate: How to prove that a language is not regular? Why $L_a$ and $L_b$ are not reguluar? $L_a = { e^i f^{n-i} g^j h^{n-j} : n in N, 1 leq i, j leq n }$. $L_b= {nm^{i_1} Read More …

Problem Detail: We have a DAG. We have a function on the nodes $Fcolon Vto mathbb N$ (loosely speaking, we number the nodes). We would like to create a new directed graph with these rules: Only nodes with the same number Read More …

Problem Detail: Assume that we want to develop a warehouse management system, which picks up plastic boxes and stacks them on a pallet. A pallet has a maximum of 5 vertical box stacks and the maximum height of a box stack Read More …

Problem Detail: Is there an algorithm for the following problem: Given a Turing machine $M_1$ that decides a language $L$, Is there a Turing machine $M_2$ deciding $L$ such that $t_2(n) = o(t_1(n))$? The functions $t_1$ and $t_2$ are the worst-case Read More …

Problem Detail: Lets say $G$ is complete undirected graph with a set of edges coloured either black or red. The problem is to find an algorithm answering if it is possible to remove a subset of nodes from $G$ in a Read More …

Problem Detail: I am kind of unsure about a reduction between two problems. Here are the two problems: PARTITION: Instance: A finite set of n positive integers $S= {a_1,a_2,…a_n}$. Question: Can the set $S$ be partitioned into two subsets $S_1$,$S_2$, s.t. Read More …