Problem Detail: I get that R is a set of languages that are decidable by a Turing Machines And that RE is a set of languages that a each language can be recognized by a TM, that is the machine will Read More …
Author: ignougroup
Print bottom view of a binary tree
Problem Detail: For a binary tree we define horizontal distance as follows: Horizontal distance(hd) of root = 0 If you go left then hd = hd(of its parent)-1, and if you go right then hd = hd(of its parent)+1. The bottom Read More …
Practical applications of disjoint set datastructure
Problem Detail: I know that the disjoint set datastructure is used to keep track of the connected components of an undirected graph when the edges are added to the graph dynamically . I also know that is is used in Kruskal’s Read More …
How does interpreting a script work?
Problem Detail: Suppose I have a script (.vbs, for example) that is stored in a file. How does the code in the file get converted into machine instructions? What is between the vbs file and the processor? Asked By : developer747 Answered Read More …
Can a semi-decidable problem be also decidable?
Problem Detail: As far as I understand, a semi-decidable (recursively enumerable) problem could be: decidable (recursive) or undecidable (nonrecursively enumerable) This post made me wonder if this is not conventionally followed. This is my answer to it and as far as Read More …
Efficient algorithm for this optimization problem? Dynamic programming?
Problem Detail: I’ve created a diagram that depicts what I’m trying to accomplish. Full-size Image In the input sequence, the nodes are as close together as possible. But I want the white nodes to be as close to their respective black Read More …
How does a two-way pushdown automaton work?
Problem Detail: Note that by “two-way pushdown automaton”, I mean a pushdown automaton that can move its reading head both ways on the input tape. I recently had the question of determining the computational power of two-way PDAs in the Chomsky Read More …
Is Dijkstras algorithm used in modern route-finding systems?
Problem Detail: Is Dijkstra’s algorithm used in modern route-finding systems such as Google maps or the satnav in your car? If not, then what is? Asked By : chopper draw lion4 Answered By : TinyProton Yes, Dijkstra’s algorithm is used in modern maps Read More …
Priority queue with both decrease-key and increase-key operations
Problem Detail: A Fibonnaci Heap supports the following operations: insert(key, data) : adds a new element to the data structure find-min() : returns a pointer to the element with minimum key delete-min() : removes the element with minimum key delete(node) : Read More …
Is the complement of { ww | … } context-free?
Problem Detail: Define the language $L$ as $L = {a, b}^* – {wwmid w in {a, b}^*}$. In other words, $L$ contains the words that cannot be expressed as some word repeated twice. Is $L$ context-free or not? I’ve tried to Read More …
