Problem Detail: I’m a computer engineer trying to understand this Eppstein paper for matching subgraphs in planar graphs. I’m trying to find subgraph matches to map an application graph (the subgraph) to a network-on-chip (the large graph). I have already implemented Read More …
Category: Uncategorized
[Solved]: this automata is NFA or DFA?
Problem Detail: That’s my question, since it has two symbols but go to a single state, is DFA or NFA? Asked By : Teo Answered By : Yuval Filmus First of all, every deterministic finite automaton is a fortiori a non-deterministic finite Read More …
[Solved]: Show that the Turing Machine domain can be viewed as a classical planning domain
Problem Detail: This is one of my assignments. I am not able to comprehend how to reduce the Turing machine domain to Classical planning domain. My understanding is that we have to essentially perform complexity analysis of classical planning domain. So Read More …
[Solved]: Why do Bloom filters work?
Problem Detail: Let’s say I am using Bloom filters to create a function to check if a word exists in a document or not. If I pick a hash function to fill out a bit bucket for all words in my Read More …
[Solved]: What’s the purpose of ANDing a bit mask with all bits set to a value?
Problem Detail: I’m adapting an algorithm for calculating a CRC 16-bit CCITT (XModem) value from an ASCII input. I’ve found some code here. I’m using the function the poster has in his question, but I’ve noticed at the bottom he does Read More …
[Solved]: Structure of a Pumping Lemma proof: contradiction or counterexample?
Problem Detail: This site is full of Pumping Lemma questions, and I do admit I’ve not read them all. I’ve tried some proofs myself and they seem to work, but I can’t find anywhere what is the (general) exact structure of Read More …
[Solved]: Construct a context-free grammar for a given set of words
Problem Detail: I have seen a few years back a nice and simple algorithm that, given a (finite) set of words in some alphabet, builds a context-free grammar for a language including these words and in some sense “natural” (e.g., the Read More …
[Solved]: Balance factor changes after local rotations in AVL tree
Problem Detail: I try to understand balance factors change after local rotations in AVL trees. Given the rotate_left operation: x y’ / / a y => x’ c / / b c a b and $b(x)$, $b(y)$ – balance factors for Read More …
[Solved]: What would dynamically-typed languages actually do if type enforcement was removed?
Problem Detail: I program in Python, which is a well-known dynamically typed language. I understand dynamic typing to mean mainly that “operations” (in a loose sense) in the language are either allowed or denied (raise an exception) based on the type Read More …
[Solved]: If $L = L(M)$ then $L$ is a subset of $L(M)$ and $L(M)$ is a subset of $L$
Problem Detail: If $L = L(M)$ then $L$ is a subset of $L(M)$ and $L(M)$ is a subset of $L$. Can anyone clarify what does this mean? Asked By : makakas Answered By : Hendrik Jan This is just a set-theoretical equality. Two Read More …
