Problem Detail: I am trying to generate a transition graph for a turing machine that accepts the languages of all strings that do not contain the substring $bbb$ with the input alphabet $Sigma = {a, b}$. When I implement this graph Read More …
Author: ignougroup
[Solved]: Studying Programming Language Theory
Problem Detail: I have recently become extremely interested in understanding and proving aspects of (functional) programming languages. However as I dive deeper in, things like $lambda$ calculus, category theory, and denotational semantics are a little difficult to grok without proper explanation. Read More …
[Solved]: Measuring the difficulty of SAT instances
Problem Detail: Given an instance of SAT, I would like to be able to estimate how difficult it will be to solve the instance. One way is to run existing solvers, but that kind of defeats the purpose of estimating difficulty. Read More …
[Solved]: If algorithm runs $theta(n)$ in time T, doubling input size has what effect on time T?
Problem Detail: In other words, is there a relationship between the step size and the actual running time? Suppose that the algorithm is run on identical machine. Asked By : Beached Whale Answered By : David Richerby There’s no clear relationship, except that Read More …
[Solved]: Type inference with product types
Problem Detail: I’m working on a compiler for a concatenative language and would like to add type inference support. I understand Hindley–Milner, but I’ve been learning the type theory as I go, so I’m unsure of how to adapt it. Is Read More …
[Solved]: What’s the difference between Process Context and Process Control Block?
Problem Detail: I know that Process Context is something that is stored when a process is preempted, containing all the necessary info to restart the process at a later time. I also know that the Process Control Block(PCB) contains all the Read More …
[Solved]: Maximum I/O Data Transfer if DMA is used
Problem Detail: I was reading lecture notes of Universiti Malaysia Perlis when I am came across following question: A computer consists of a CPU and an I/O device $D$ connected to main memory $M$ via a shared bus with a data Read More …
[Solved]: The equivalence relations cover problem (in graph theory)
Problem Detail: An equivalence relation on a finite vertex set can be represented by an undirected graph that is a disjoint union of cliques. The vertex set represents the elements and an edge represents that two elements are equivalent. If I Read More …
[Solved]: Why is the orthogonal line segment intersection algorithm $O(nlog n+R)$ instead of $O(nlog n + Rn)$?
Problem Detail: In the same lecture notes without providing many details it says that the complexity of the algorithm which uses a balanced search tree is $O(nlog n+R)$ where $R$ is the total amount of intersections. However I don’t understand Read More …
[Solved]: What if traversal order of two of pre-order, in-order and post-order is same?
Problem Detail: Supposing a tree T has the identical: Pre-order traversal and in-order traversal Pre-order traversal and post-order traversal In-order traversal and post-order traversal How does T look like? From the previous discussion in SO, I learned that pre- and post-order Read More …
