Problem Detail: A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it counting repetitions. (a) What is the number of multisets of size Read More …
Author: ignougroup
[Solved]: Rational agent question from Russell and Norvig
Problem Detail: Question from Artificial Intelligenge: A Modern Approach by Russell and Norvig (Exercise 2.1). Suppose that the performance measure is concerned with just the first $T$ time steps of the environment and ignores everything thereafter. Show that a rational agent’s Read More …
[Solved]: Find similar vector by Locality Sensitive Hashing
Problem Detail: I have many vectors in my database. They are in high dimensions such as: $v_1$ : $langle 23, 23, 1, 33, 103, 219, dots rangle$ $v_2$ : $langle 92, 83, 1, 33, 239, 192, dots rangle$ … I will Read More …
[Solved]: Regular expression for ${a^k b^m c^n mid k+m+n text{ is odd} }$
Problem Detail: I have to make a regular expression from the following laguage: {$a^kb^mc^n : $ where k + m + n is odd} Is is possible for the sum of three numbers to be odd (other than three consecutive odd Read More …
[Solved]: Sum number of times statement is executed in triple nested loop
Problem Detail: I have this code fragment: for( i=0; i<n; i++ ) for( j=0; j<i; j++ ) for( k=0; k<j; k++ ) S; I need to find the number of times that S is executed in that code block. I plugged Read More …
[Solved]: Converting a 2-SAT formula into an implication graph
Problem Detail: Both wikipedia and my lecturer explained how the 2 satisfiability problem work. However, I am finding it really hard understanding how this formula: xvy≡ ¬x–>y ≡ ¬y –>x Then breaks down the following conjectures : (¬x v y) & Read More …
[Solved]: Show a TM-recognizable language of TMs can be expressed by TM-description language of equivalent TMs
Problem Detail: I am studying “An Introduction to the Theory of Computation” by Sipser — there is a problem *3.17 (p.161) which I can not solve. Any hints (not answers) from which side to attack it? Let $B={M_1, M_2, …}$ be Read More …
[Solved]: Eliminating Null Productions from Context Free Grammar
Problem Detail: Here is a problem I am trying to solve: S -> 0A0 | 1B1 | BB A -> C B -> S | A C -> S | e I know that C is nullable (since it produces an Read More …
[Solved]: Iterative lengthening search: iterative version of Uniform Cost Search or DFS?
Problem Detail: Actually my question has two parts: 1) I wanted to know that whether Iterative Lengthening Search is used in combination with DFS or Uniform Cost Search? Actually, in Russell and Norvig book (on page 90), it is described as Read More …
[Solved]: Can context-free grammar generate $a^{2^n}$?
Problem Detail: Context-free grammar can generate the string a 2 n for n≥0 . The production rule P is S→SS|a . The derivations is, for example: 1) S⇒a (this is when n = 0) 2) S⇒SS⇒aa (this is when n = Read More …
