instruction stringlengths 35 29.1k |
|---|
I know that each regular language can be generated by a CFG.
This makes, in one sense at least: context-free languages more general than regular languages.
Are there known results about the 'complexity' of regular languages in the CFG context? For example, is it true that every regular language can be generated by an u... |
I'm trying to find a solution for this exercise:
Give the pseudocode of an algorithm which takes two positive integers
n and k and prints all the non-decreasing sequences of length k
(1,2,...,n).
For example n=4, k=3:
111 112 113 114 122 123 124 133 134 144 222 223 224 233 234 244 333
334 344 444
the complexity ... |
I have been faced with a problem where three concurrent processes X, Y ,Z execute three different code segments that access and update certain shared variables. Before entering the respective code segments :
Process X executes the P operation on semaphores a,b and c;
Process Y executes the P operation on semaphores b,... |
I am trying to find a good resource for learning on how to design and create a new programming language. It seems like a search for books in amazon raises some difficulties, because the vast majority of results are about programming languages, not on how to design them.
|
I know that:
If $f(n) = O(g(n))$ , then there are constants $M$ and $x_0$ , such that
$f(n) <= M*g(n), \forall n > n_0$
The other, plain English way of defining it is,
If $f(n)=O(g(n))$ then for large $n$ , $f(n)$ would grow as fast as $g(n)$.
I got confused when comparing $2^n$ with $2^{2n}$. Here , $f(n) = 2^n$ and ... |
Looking at this solution on page 3 but having trouble understanding the evaluation function specifically.
For non terminal positions, we use a linear evaluation function
defined as
Eval (s) = 3[X2(s)]+X1(s)−(3[O2(s)]+O1(s))
We define X n ( s ) as the number of rows, columns, and diagonals in
state s with exactl... |
Earlier this week a paper was released describing an algorithm for building optimal alphabetic ternary trees. The alphabetic property as described on Wikipedia as
Alphabetic trees are Huffman trees with the additional constraint on
order, or, equivalently, search trees with the modification that all
elements are ... |
In case of branch Instructions such as beq, bne, we use PC-relative addressing.
But I am really not clear why it is said in most of the books that MIPS address(while calculating branch target) is actually relative to the address of following instruction PC+4 as opposed to the current instruction PC?
Anybody please exp... |
Many people say that TAOCP is not supposed to be read as a book (actually a volume of books), but if I decide to go that way, which math/computer science books/topics do I need to study to help me follow it? There is a related question on stackoverflow but I would like to read the suggestions of cs.se users.
|
The Cheriton-Tarjan MST algorithm finds MSTs in time O(m log log n) in arbitrary graphs by using a cleverly-modified version of a leftist heap data structure to store edges. It was developed in 1976. The algorithm relies on the fact that leftist heaps can be merged in time O(log n), but also uses the fact that leftist ... |
Say I have 2 carts on an infinite railroad, each cart is initially under a lamp.
There are only 2 lamps, and they are at a fixed location, hence they don't change their location. The distance between them is D, but its not known.
Each cart has a processing unit, both will execute a copy of the same program once the who... |
I am looking at the answer in solution manual which asked , all the words that don't have both substring bba and abb.
and the answer was a*(baa*)*b+b*(a*ab)*a*
and I'm like wait a minute is that right ? but that can't make abb, which is in the language. So it's gotta wrong.
so I came up with my own , would this be all ... |
Suppose I wanted to find all valid nets of a polyhedron. Is this kind of problem NP-Hard?
My guess is that it is. If you were to increase the "complexity" of the polyhedron (maybe this is the number of faces?), there is no "shortcut" to discovering all the nets; you would have to enumerate all combinations. This sort o... |
The below is from an article titled:
Minimax: Recursive Implementation
To be a recursive function, you need to call yourself.
What part of this pseudo code is calling itself?
How does depth-first effect the recursion process?
There seems to be a return in every line of minimax-value,
shouldn't the return be only o... |
I am a high school student computationally studying the 3-dimensional structure of chromosomes by 40 kilobase loci. In a nutshell, loci that are close in space tend to express their genes at the same time ― loci are different stops on a 3D-winding DNA chain.
The best way to understand the 3D structure is by gathering w... |
A homework problem in my current CS class asks us to produce a comparison-based procedure for taking (essentially—there are some poorly-specified rules about duplicates) the set intersection of $k$ unsorted arrays of at most $n$ elements each. For full credit, we are supposed to do this in $O((k-1)n)$ comparisons. (Spe... |
I need help constructing a Left Linear grammar for the language
$L = \{ a^n b^m c^p \mid n\geq 2, m\geq 3, p\geq 4 \}$
Here is what I have so far, I know :
$N = \{S\}$
$T = \{ a, b, c \}$
$P = \{$
$S \rightarrow Pcccc$
$P \rightarrow Pc$
$P \rightarrow M$
$M \rightarrow Mbbb$
$M \rightarrow Mb$
$M \rightarrow N$
$N \ri... |
The following was asked as part of a homework assignment and I am not asking for the solution to these but rather tips or resources on how to solve this and similar questions,
Let $f(n)$ and $g(n)$ be two functions from $\mathbb{N}^+$ to $\mathbb{R}^+$. Prove or disprove the following assertions. To disprove, you only... |
I'm currently reading a book (and a lot of wikipedia) about quantum physics and I've yet to understand how a quantum computer can be faster than the computers we have today.
How can a quantum computer solve a problem in sub-exponential time that a classic computer can only solve in exponential time?
|
Could somebody explain the difference between dependent types and refinement types? As I understand it, a refinement type contains all values of a type fulfilling a predicate. Is there a feature of dependent types which distinguishes them?
If it helps, I came across Refined types via the Liquid Haskell project, and de... |
Why can't arbitrary base conversion be as fast as converting from base $b$ to base $b^k$ ?
Seems to be a big time complexity difference! I am also interested in reading material about it.
Old. Original detailed question
Conversion between power-2-radix can be done faster than between non-power-of-2 radix, they can b... |
I read in this article that the amount of bits that can be emulated by a certain number of qubits is 2^(number of qubits). This is because each qubit can be in one of 2 states after it collapses, and so before all the quantum... whatevers collapse, that is the function that gets that result. At least, that was generall... |
This is a problem involving the theory of regular languages. I am stuck on this problem and do not know how to solve this type of problem.
Prove that the language $B_n = \{ a^k \mid k \text{ is a multiple of } n \}$ is a regular language for any $n \ge 1$.
Let me describe my thoughts thus far: It is easy to show ... |
I was trying to rule out whether this was LL(1) by checking for left-recursion in the following grammar:
$\qquad A \to 0 A 1 \mid 0 1$
Which produces:
$\qquad 0 A 1 \Rightarrow 0 0 A 1 1 \Rightarrow \dots$
But I am unsure what type of recursion this is called, since it sorta stays in the middle.
If this is not left-re... |
I've been reading about the No Free Lunch Theorem, but I can't quite understand what it is about. I've heard this theorem described elsewhere as the claim that "no general purpose universal optimiser exists". On the other hand, the Wikipedia article talks about 'candidate solutions" that are "evaluated one by one" - i... |
Linearizability is a well-known correctness condition for concurrent objects. It provides the illusion that each operation applied by concurrent processes takes effect instantaneously at some point between its invocation and its response. To prove linearizability of an implementation, it is necessary and sufficient to... |
Let $L = \{a^n \mid n \ge 0\}$, where $a^0 = \epsilon$ and $a^n = a^{n-1}a$ for all $n \ge 1$.
Thus $L$ consists of sequences of $a$ of all lengths, including a sequence
of length $0$. Let $L_2$ be any infinite subset of $L$. I need to show there always exists a DFA to recognize $L_2^*$.
If $L_2$ is a finite subset it... |
Suppose we had 2 arrays of the same size with positive numbers and we wanted to pair up the elements of each array such that the total difference between the pairs is minimized.
The first thought would be to choose pairs with the minimum difference and so on. But it turns out the correct algorithm is to sort them and t... |
Suppose in a given plain there are fixed number of lines. A point P lies on one of the line. How to find which line intersects the point P ? I am giving an example
In the above graph point P is on the line CE. We can determine it visually.But my problem is how to make the computer understand it. Is there any algorith... |
Here is a context-free grammar with a single nonterminal symbol S and three terminal symbols +, *, and s:
S -> + S S | * S S| s
My purpose is to build the LR state machine for this grammar. My attempt:
[State 0] -> [State 1] -> [State 2]
S -> . + S S (+) S -> + . S S (*) S -> * . S S
... |
I'm trying to write some little code (POC for the selection/mutation operators) that uses a genetic algorithm to solve a global maximum for a function.
f(x_1...x_n) = M - (x_1 - a_1)^2 - (x_2 - a_2)^2 - ... - (x_n - a_n)^2
M a_i are constants. I have to find x_i such that f(x_i) = max(f) = M
My selection method is tru... |
I'm trying to understand the Huffman compression algorithm.
Lets assume the word : YESSSS
According to Huffman tree we will get :
S : 4 times -> Code : 0
Y : once -> Code : 01
E : once -> Code : 00
at the end YESSSS will become : 01 00 0 0 0 0
So far everything is clear.
Now my problem is in the space between t... |
How can we prove a binary search tree with $n$ internal vertices has height $h = \lceil \log(n+1) \rceil$?
|
I was convinced that my idea for a solution to sort $k$ sorted lists into one list would work with a 'variation' on MergeSort. I was told this would not work and had to use Heapsort, but didn't get any explanation or intuition behind it. (I believe the assumption is that each of the $k$ lists had size $\frac{n}{k}$)
Es... |
The Triangle Cover Graph problem is this:
Given a graph $G = (V,E)$ and an integer $k$, does there exist a set of at most $k$ vertices of $G$ such that every triangle contained in $G$ also contains a vertex of the set?
This problem is obviously in $NP$ as its verifier is just the set which you can easily check. Howe... |
I have a question regarding a graph algorithm which is as follows:
Given a graph $G = (V,E)$ whose vertices are uniquely labeled $\{1, 2,\dots ,n\}$ we want to determine the smallest integer $k$ such that deleting vertices $1$ through $k$ results in a graph whose largest connected component has at most $n/2$ vertices (... |
Suppose we were using a priority queue (PQ) to implement Prim's algorithm. My understanding is that initially the weight of all vertices is set to $\infty$. The weight of the starting vertex is then set to $0$. All of the vertices are then inserted into the PQ.
Does that mean that we can insert the vertices in any or... |
While studying automata theory a typical problem that I face is of the following type:
Constructing a DFA with minimum number of states for all strings over
$\{a,b\}$ which have number of $a$’s divisible by $X$ and number of $b$’s
divisible by $Y$ (where $X$ and $Y$ are some positive integer values).
Is there som... |
Let $G=(L,R,E)$ be a bipartite graph, are there conditions on the degree of the vertices under which the condition of Hall's theorem is surely satisfied? (meaning a perfect matching exists in the graph).
Konig's theorem proves that every $k$-regular bipratite graph has exactly $k$ edge disjoint perfect matchings, so th... |
When analyzing an algorithm, the following recurrence relation popped up:
$T(n,d)=2T(n/2,d)+T(n,d-1)+O(dn)$
where $T(n,1)=O(n \log{n})$ and $T(1,d)=O(d)$.
By applying the Master Theorem inductively, for any particular $d$, it holds that $T(n,d)=O(n (\log{n})^d)$. However, it does not necessarily hold that $T(n,d)=O(n (... |
Let $G=(V,E)$ be a directed graph. The connectivity of a graph is the defined as the cardinality of a smallest separator of $G$. A separator of $G$ is a subset $U$ of $V$, such that $G-U$ is not strongly connected.
Why does the following algorithm compute the connectivity of a graph correctly?
\begin{equation}
\begin{s... |
It makes me wonder that despite of (CFL) being a subset of Turing Decidable languages, Turing Decidable is closed under intersection while CFL is not.
Does not Turing Decidable engulf all CFLs?
|
I am taking a programming languages course, and we have had to use the Inversion Lemma many times in our proofs of preservation. We have been given the Inversion Lemma in each of these examples, but is there a general statement of the inversion lemma that can be applied to any proof of preservation? Can someone write t... |
Describe a regular language that cannot be accepted by any DFA that has only three states.
I'm not really sure where to start on this and was wondering if someone could give me some tips or advice. I understand that the pumping lemma can be used to prove a language is not regular, but in this case, it should be a reg... |
How can I find the cost of pseudocode with a nested loop and a nested if statement?
On the left hand side is an example from a textbook I am following. On the right hand side is pseudo code that I found. I took a guess, but I don't know what the time would be for the inner code fragments.
I am especially unsure what t... |
I know that depth-first search can be used to produce a depth-first spanning tree, which classifies all edges as tree edges, forward edges, backward edges or cross edges. Are there any algorithms that make use of the depth-first spanning tree?
|
I am considering strategies to compare the performance of routers with buffers vs. their lower latency counterparts in a simple network setting (N clients communicating with each other randomly through a router). I know that buffered routers should ideally perform better when there are traffic bursts.
My question is re... |
I have an undirected graph where each node is labelled with an integer key and I'm asked to detect every simple 4-cycle, which can be seen as an empty square (i.e. the two opposite nodes of the cycle have not to be connected).
I know the labels of a generic square in the graph can be permuted in $4! = 24$ ways, but on ... |
Background:
In section 4.2 of the paper Linearizable Implementations Do Not Suffice for Randomized Distributed Computation@STOC'2011, the authors mentioned two typical proof strategies for linearizability of implementations. In the following, Let $O$ be the implemented object and let $H$ be a history over $O$.
In one ... |
Given a linear grammar G, is it possible to determine if L(G) contains a palindrome?
|
Context-free grammars, as well as other types of grammars, can naturally
associate structure with the strings of the defined language, for
example tree structures in the case of context-free language.
What kind of structural features can be thus described by regular grammars,
and associated with the strings of the lang... |
this optimization problem, I am working on, is kind of making me crazy. ;)
Given is a list o of sets (with finite cardinality) of strictly positive integer values (Z>0), e.g.:
o_without_sizes =
[ {1, 2, 3, 4}
, {5, 6}
, {2, 3, 4, 5}
, {5, 6, 7}
, {7, 8}
. {9} ]
Every set has a name n (also in Z>0, but only for identif... |
I have thought about the most useful way of checking an array for 2 elements that sum to X.
The trivial solution is to check the sum of every element with every element, and the complexity of this solution is $O(n^2)$.
My solution is:
Say the array is A.
It's length is N.
Elements are from A[0] to A[N-1]
Pseudo-Code is... |
I am struggling with this question for a very long time and just can't find the flaw. So I am given a false Theorem:
The language $\{awwa \mid w \in \{a,b\}^* \}$ is regular.
Well, that part is obvious, we can prove that the language is not regular using the pumping lemma.
The question I am asked is to find the flaw ... |
I've seen a lot of text concerning the first NP-Complete problem, Boolean Satisfiability. I guess I'm confused concerning the language.
It sounds to me as though the problem could be difficult to compute (hence the NP-complete), however it still might be satisfiable. As in, there exists a satisfying mapping of literal... |
I hope I named this CNF Boolean sentence the correct way. The way I see it, a 2P2N is where each literal appears twice (or at most twice, but we can say twice without loss of generality).
I am trying to prove it is Satisfiable. How do I do this? Do I need to try to reduce it to 3-SAT (might need some help doing that a... |
I've noticed that some languages include a logic engine as part of their type system (e.g. Shen, Typed Clojure).
Other languages have a much more direct type checking algorithm (e.g. Haskell / Hindley-Milner).
What specific features of a type system make it necessary to include a logic engine?
|
Say $A'$ is the output of $\mathrm{Bubblesort}(A)$ on an array of length $N$.
To prove that Bubblesort works, we have to prove that it always terminates and that
$$A'[0]\leq A'[1] \leq \dots \leq A'[N-1].$$
Is there anything else that needs to be proven to show that Bubblesort actually sorts?
(I have found this questio... |
will you recommend use of branch prediction buffers for 5 stage integer MIPS pipeline. Does this increase the efficiency or not?
|
I am reading about the various phases of the Instruction Execution, I found out that we have three phases like below.
Fectch
Decode
Execute
Now if the part I don't understand is why do we need a decode phase ? The instruction will already be stored in a binary format at some memory location, why not just fetch and ex... |
I'm looking for an (efficient) algorithm to solve the following problem:
Given a string $S$ and a set of characters $M$, find the shortest string composed only of characters in $M$ that is not contained in $S$.
Try as I might, I can't seem to map this problem to any of the standard CS string problems.
|
Here I am trying to show that the pair of Finite Automata are equivalent. I have tried something but I am not sure if I am in the right direction. This is what I have.
These are pairs of FA's. Set theory formula in here is (L1' + L2)' + (L2' + L2)'
Conclusion:
Both machines (FA1'+FA2)' and (FA2+FA1)' has no final ... |
I have a question that asks me to find the minterm expression of two functions added together. The two functions in this case are
F = m(0,4,5,6)
G = m(0,3,6,7)
At the moment my reasoning is that the minterm expression of F + G would be the combined minterms of each function, taking out any repetition. So the result wou... |
I am new to artificial intelligence. I have been trying to analyse the time complexity of 8-queen, by placing one by one without attack.
One approach to achieve goal state is to "add a queen to any square in the leftmost empty column such that it is not attacked by any other queen". And this approach will have a state ... |
We were presented in class with an algorithm for finding the maximum in an array in parallel in $O(1)$ time complexity with $n^2$ computers.
The algorithm was:
Given an array A of length n:
Make a flag array B of length n and initialize it with zeroes with $n$ computers.
Compare every 2 elements and write 1 in B at t... |
Recently i was studying removal of useless symbols in productions given in Ullman Hopcroft.
The grammar goes as follows
S-> aAa | aBC
A -> aS | bD
B - > aBa | b
C-> abb | DD
D -> aDa
In the explanation that follows, we eliminate D obviously, but the removal of C still baffles me. As D is non generating, but C is both g... |
Let
$T\equiv\lambda xy.x$
$F\equiv\lambda xy.y$
Numbers are represented as:
$0\equiv\lambda sz.z$
$1\equiv\lambda sz.s(z)$
$2\equiv\lambda sz.s(s(z))$
$N\equiv\lambda sz.\underbrace{s(s( ... (s(}_\text{N times}z))...))$
I want to define zero checking expression $Z$, being applied to $0$ reduces to $T$, otherwise $F$. ... |
Consider a DFA over $a,b$ accepting all strings having number of $a$ 's divible by 6 and number of $b$ 's divisble by 8. What is the minimum number of states in the resultant DFA ?
This problem can be solved by assuming 2 DFAs. One accepting the number of $a$ 's divible by 6 and the other accepting with number of $b... |
I've got a simple question:
Let's say we have the following definition of a language over some alphabet: $L = \{w \mid w \text{ contains the infix } aab\}$
Does that mean $aab \in L$? or does "$aab$" have to be "wrapped" on both sides by other letters?
|
I was trying to solve a question dealing with n instructions in an uneven pipeline with k stages. I came across a generic formula for even pipelines i.e. (k + n - 1) * clock cycle. But I feel this should not work for uneven pipelines as the above formula is based on fact that the 1st instruction takes time = sum(time o... |
From the Wikipedia page on the IEEE Standard for Floating-Point Arithmetic,
The possible finite values that can be represented in a format are determined by the base (b), the number of digits in the significand (precision, p), and the exponent (q) parameter emax:
...
q must be an integer such that 1−emax ≤ q+p−1 ≤ ema... |
I was proposed (in school) to develop an approach to solve optimally the balanced partition problem. I tried the pseudo-linear algorithms but SUM is very large (~1M) and so O(S*N) cant run under available time (1000ms). I talked to the teacher and with N =< 60 he recommended the brute force (we are learning recursion).... |
If we were to have a trap state in a DFA and we are converting it to a regular expression, how exactly would I incorporate that into the regex? Let's say our language only accepts a*, and my DFA has a start state/final state with a a loop, and once I get a b it goes into a trap. Would the regex simply be a* meaning we ... |
I'm struggling a bit to understand two of the problems we were given in class. Could someone look over my work and maybe give me a few hints?
State whether the following languages are regular or not and prove your answer.
$$\{0^n1^m \mid m \geq 0 \text{ and } n = 2m+1\}$$
$$\{0^a1^b0^c \mid 0 \leq a \leq b \leq c \leq ... |
Why are instruction decoding and register read are combined in single stage of a 5-stage MIPS-pipeline, even though they serve two different operation?
|
I came across a question on which I got totally stuck :( a sort of homework question)
A weight-balanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the... |
I am currently studying model theory and I am trying to decide if a clause is a Horn Clause. I know that a Horn Clause is a clause with at most one positive literal, but there are some clauses that it is not easy to decide whether they are Horn or not.
E.g.,
(P->Q)->W
Is there any way to decide whether this clause is ... |
For example,
$T(n) = \log {n} \cdot T(\frac{n}{\log{n}}) + \Theta(n)$
I tried using the substitution method with $ n = 2^m $, but that got me nowhere, since it still ends up with a $m$ and $2^m$. The recurrence tree method also becomes rather complicated. Is there a general approach to follow to solve such recurrences... |
So I have a question for the recurrence $T(n) = 2T(\sqrt{n}) + \log n$. We are to use substitution method to figure out the solution. This is an example problem (not a exercise problem) in my book (Introduction to Algorithms, Third Edition pg. 86). I'm having a hard time understanding how they rename $m = \log n$.
The... |
It is known that a nondeterministic universal turing machine (UTM) can simulate another nondeterministic TM with running time $t(n)$ in time $c t(n)$, where $c$ is a constant. It is also known that a deterministic UTM can simulate another deterministic TM with running time $t(n)$ in time $ t(n)\log(t(n))$.
My question... |
My question here is dealing with the residual that I get. We are trying to prove $T(n) = 3T(n/3) + n$ is $O(n*\log n)$. So where I get is $T(n) \le cn[\log n - \log 3] + n$. So my residual is $-cn\log 3 + n$. So if I minus it I get $-(cn\log 3 -n) \ge 0$ right? How do I figure out what values of c & n are? Do I use th... |
I know that a logspace transducer is a deterministic Turing machine that enables us to use log-space complexity. I do not understand though why that is correct. Whatever algorithms can be implemented in that machine are automatically of log-space complexity? Why is that?
|
For the past several months I've been interested in some Machine Learning and I can't help but notice that nomatter what kind of learning algorithm I'm using - at its core lies a simple polynomial or logistic regression. Today I went back to the most basic definition that I could find:
Machine learning, a branch of ar... |
What will be the complexities in the following case:
T(m,n) = T(m-1,n) + T(n-1,m) + O(m*n)
After a bit of searching I found that if I could make this function monotonic and then try to find the solution. But I am feeling that this is not the correct way to do it.
Kindly suggest the solution to it.
|
I'm studying the online learning model and the Halving algorithm.
We've seen the threshold problem:
The domain is $X=\left\{ 1,2,...,N-1\right\} $, the label set is $Y=\{-1,1\}$ and the hypotheses class is $H=\left\{ h_{\theta}(x)=sign(x-\theta):\theta\in\left\{ \frac{1}{2},1+\frac{1}{2},...,(N-1)+\frac{1}{2}\right\} ... |
In some (historical) papers, chess has been referred to as the drosophila of artificial intelligence. While I suppose that in current research, the mere application of a search algorithm is at best advanced computer science, I believe that there are still area's where can apply (and practice) AI-techniques.
A simple ex... |
How can one select the proper number of parameters for a genetic algorithm to model a given system?
For example, say you want to optimize production of cars, and you have 1,000 measurements of hourly efficiency at various tasks for each of 1,000 different employees. So, you have 1,000,000 data points. Most of these a... |
For many machine learning projects that we do, we start with the k Nearest Neighbour classifier. This is an ideal starting classifier as we usually have sufficient time to calculate all distances and the number of parameters is limited (k, distance metric and weighting)
However, this has often the effect that we stick ... |
This question is about an approach to computer opponents that I have created and are either currently being used, or are planned to be used, in several computer games.
Background
Last year, when trying to improve a computer opponent for a game called "Minesweeper Flags" (short description: A turn-based multiplayer vers... |
I am trying to recognize waterways from aerial photographs (say from Google Maps). Local governments often have GIS data that says where the waterways (and roads, buildings etc) are, but the water data in them is often somewhat inaccurate, and we might be able to improve them using aerial imagery. So we have some data ... |
My lecturer for Algorithms said that most of the data structures I will encounter in the algorithms course I am taking have a basic action which is of O(1).
Ex: Binary heap.
Basic action is:
Compare 2 childen.
Compare the "winner" with his parent.
Replace when needed.
Do 1-3 with the "winner", until and including the... |
It is a well-known fact that "Correlation doesn't equal causation", but machine learning seems to be almost entirely based on correlation. I'm working on a system to estimate the performance of students on questions based on their past performances. Unlike other tasks, like Google search, this doesn't seem like the kin... |
In most implementations of genetic algorithms, the focus is on crossover and mutation. But somehow, most of them leave out diploid (dominant/recessive) nature of genes. As far as my (limited) understanding goes dominant/recessive nature of genes is a very important factor in deciding the actual characteristics of an or... |
Suppose I have got a solar-powered autonomous surface vessel somewhere in the fjords of Norway, supplied with a fairly recent set of maps, a GPS receiver, and no means of downlinking detailed commands from me. This vessel has to reach, say, the island of Hainan at the earliest possible moment.
What are the determinist... |
When I started to learn about imperative programming and declarative programming it raised many doubts, like, how are structured, modular and object-oriented programming classified: declarative or imperative?
|
Suppose $L1, L2$ are both regular languages and $A1, A2$ are their corresponding DFA's.
How can I construct a new DFA for the regular language $L1 \cup L2$?
|
I am unclear on when to use the Monte Carlo random sampling method for algorithm design. The classic example that I keep seeing is using random points within some bounding rectangle to determine the area of some irregular figure. Wouldn't a regular periodic sampling provide more repeatable results for this application ... |
A forest is a collection of trees.
Is there a similar notion for paths? e.g., a _______ is a collection of paths.
|
Writing a proof by contradiction is fairly formulaic--first you assume the opposite, then derive a contradiction. I would like to know the steps and conventions for writing a many-one reduction proof. This answer was somewhat helpful, but like other explanations I've heard, it sounds too similar to a proof by contrad... |
I was going through the text Introduction to Theory of Computation by Michael Sipser. It is written that $R\circ\emptyset$ may not equal to $R$. I thought $R\circ\emptyset=\emptyset$ always. $R$ is any regular expression.
Couldnt find any example that contradicts that
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.