Problem Detail: $L := {w in {0,1}^* | $the length of $w$ is odd $ wedge $ 1 is in the middle of $w}$ So the alphabet is ${0,1}^*$. My problem is that I can’t keep track of the equality of Read More …
Category: Uncategorized
[Solved]: More efficient algorithm for determining if one list is a sublist of another list
Problem Detail: I’m trying to build an algorithm which takes two lists of natural numbers and finds if every element of the first list is displayed at least once in the second list. What if the list is sorted? An algorithm Read More …
[Solved]: Can a schedule with cyclic precedence graph still be serialisable?
Problem Detail: We know Every conflict serializable schedule is serializable, but not all serializable schedules conflict-serializable. (*) so it means there is at least one serializable schedule that not conflict serializable. One way of Testing conflict serializability is using Directed graph Read More …
[Solved]: Separate all leaves of a weighted tree with minimum weight cuts
Problem Detail: This is part of a larger problem, which I believe I have reduced to this. Given a tree $T$ having positive edge weights, and $k$ leaves (nodes which have exactly one connected node), I need to delete some edges Read More …
[Solved]: Counting Number of arrays where sum of ith row is greater or equal to (i-1)th row
Problem Detail: I am working on a problem where I am supposed to count the number of arrays of size $Ntimes M$ where the sum of elements in the $i$-th row is greater than or equal to the the sum of Read More …
[Solved]: How exactly does a two stack pushdown automaton work?
Problem Detail: I have to explain how a 2-PDA works and then write a program (in Delphi) which simulates a 2-PDA step by step for the language $L = {w$w | w ∈ {0,1}^n with n>0}$. So far, so good. Now Read More …
[Solved]: How do I show that a DFA accepts only one word?
Problem Detail: I want to show that $qquaddisplaystyle O = {M : M text{ is a DFA}, |L(M)| = 1}$. Here $|L(M)|=1$ means the DFA contains only one state. I really don’t know where to get started in this problem. Should Read More …
[Solved]: Halting problem without self-reference
Problem Detail: In the halting problem, we are interested if there is a Turing machine $T$ that can tell whether a given Turing machine $M$ halts or not on a given input $i$. Usually, the proof starts assuming such a $T$ Read More …
[Solved]: Language for teaching basic programming
Problem Detail: I’m interesting in teaching programming to middle school students. I’d like a programming language with the following criteria: Simple – pared down to the absolute minimum needed to support sophisticated programming without too much code. As such, for this Read More …
[Solved]: Turing Machine that computes maximum steps of halting machines
Problem Detail: Suppose that $TM_{halting}$ is the set of machines that halt. Given a number of states $m$ and a length $n$ of the input, let $f(m,n)$ be the maximum number of steps a machine with $m$ states in $TM_{halting}$ can Read More …
