Answered: L1={w∈{a,b}* | w starts with a} and…

Engineering

Computer Science

L1={w∈{a,b}* | w starts with a} and L2={w∈{a,b}* | |w|≤ 3} then | L1 ∩ L2 | = a) 15 b) infinity c) 7 d) 1

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

onsider the challenge of determining whether a witness questioned by a law enforcement agency is telling the truth. An innovative questioning system pegs two individuals against each other. A reliable witness can determine whether the other individual is telling the truth. However, an unreliable witness's testimony is questionable, below is a confusion matrix of all the possible outcomes from a given scenarios, This pairwise approach could then be applied to a larger pool of witnesses. Answer the following: Assume a pool of K witnesses, in which the reliable ones are eager to help solve a case, and the unreliable ones are equally eager to hide the truth. Prove that if more than half of the witnesses are unreliable, the approach outlined above cannot help identifying the reliable witnesses.
Indian cricket team Players at an winning celebration dine at a circular table on which there is a single fork between each Player. Players either eat or think, and always start dinner thinking. To eat, a Player first picks up the fork immediately to his left and, once successful, picks up the fork immediately to his right. When a required fork is not on the table, the Player waits, neither eating nor thinking, until the fork is returned to the table. After eating, a Player returns both forks to the table. No cutlery is required to think. Your task is to model the above scenario in Java. (a) Write a class called Fork with two public methods, ForkpickUp and ForkputDown. The methods should take no arguments and return no result. An instance of Fork should act as a lock to prevent concurrent access. In other words, once ForkpickUp has been called, all further calls to ForkpickUp should block until ForkputDown is called; when ForkputDown is called, one caller (if any) who is blocked should…
Maximum weight = 20The above problem is a 0/1 Knapsack problem. Here there are 7 different objects labelled from A to G. The objective of this problem is to carry the different objects in your bag in such a way such that the profit is maximized. But you have to make sure that your bag does not exceed the maximum weight i.e. the maximum weight that this bag can carry is less than or equal to 15. Remember you can carry an object exactly once. Now it is your job to use Genetic Algorithm to solve this problem. 1. Encode the problem and create an initial population of 4 different chromosomes 2. Think of an appropriate fitness function to this problem and give proper justification. 3. Use the fitness function to calculate the fitness level of all the chromosomes in your population 4. Perform natural selection and select the two fittest chromosomes 5. Use the parents from (4) and perform crossover to get 2 offspring 6. Perform mutation and check the fitness of the final offspring. Comment…
A Marble Game is played with M marbles on a square board. The board is divided into NxN squares, andM of those squares contain holes. Marbles and holes are numbered from 1 to M. The goal of the Marblegame is to roll each marble into the hole that has the same number. A game board may contain walls.Each wall is one unit long and stands between two adjacent unit squares. Two squares are consideredadjacent if and only if they share a side.At the beginning of the game, all marbles are placed on the board, each in a different square. A “move”consists of slightly lifting a side of the game board. Then all marbles on the board roll downward towardthe opposite side, each one rolling until it meets a wall or drops into an empty hole, or until the nextsquare is already occupied by another marble. Marbles roll subject to the following restrictions: Marbles cannot jump over walls, other marbles, or empty holes Marbles cannot leave the board (The edge is a wall) A unit square can contain at most…
[Job sequencing using deadlines]Let us suppose that there are n jobs (J1, J2, … Jn) each of which takes a unit oftime to be processed by a machine and there is just one single machine to processthe jobs. Let us suppose that (d1, d2, d3, …dn) are the deadlines in units of times to complete the jobs and (p1, p2, p3, …pn) are the profits earned if the jobs are processed within the deadline. The objective is obviously to select those jobs and complete them within their deadlines so that maximum profit is earned.Design a greedy method to obtain the optimal sequence of jobs that will earnmaximum profits. Demonstrate it on the case where there are four jobs, with n = 4,deadlines given by (d1 = 2, d2 = 1, d3 = 3, d4 = 1) and profits earned as (p1 = 100,p2 = 20, p3 = 50, p4 = 40).
Q. No. 2: Let Σ = {a, b, c}. a. Draw a DFSA that rejects all words for which the last two letters match. b. Draw a DFSA that rejects all words for which the first two letters match.
Texas Hold em poker game 2 to 8 human or computer players Each player has a name and stack of chips Computer players have a difficulty setting: easy, medium, hard Summary of each hand:o Dealer collects ante from appropriate players, shuffles the deck, and deals eachplayer a hand of 2 cards from the deck.o A betting round occurs, followed by dealing 3 shared cards from the deck.o As shared cards are dealt, more betting rounds occur, where each player can fold,check, or raise.o At the end of a round, if more than one player is remaining, players' hands arecompared, and the best hand wins the pot of all chips bet so far. What classes are in this system? What are their responsibilities? Which classes collaborate? Create the Use Cases for this systemCreate a Use Case diagram for this system Draw a class diagram for this system. Include relationships between classes (generalization andassociational).
Construct a DFA A so that L(A) = L(N) where N is the following NFA:
Q. There is an island that has two kinds of inhabitants, knights, who always tellthe truth, and their opposites, knaves, who always lie. It is assumed that every inhabitant of theisland is either a knight or a knave. Below there are 3 inhabitants, who are denoted by A, B andC.A. What are A, B and C if A says “If B is a knave then C is a knave”, and B says “If Cis a knight then A is a knave”? Briefly explain your reasoning.B. What are A,B and C if A says “B is a knight and C is a knight”, and B says “A is aknight if and only if C is a knave”? Briefly explain your reasoning.
Selection Problem: Let a and b be integers with a ≤ b, and let [a, b] denote the set {a, a + 1, a + 2, . . . , b}. Suppose we are given n such sets [a1, b1], . . . , [an, bn], their multiset sum is S = {a1, a1 + 1, . . . , b1, a2, a2 + 1, . . . , b2, . . . , an, an + 1, . . . , bn}. Note that some integers can occur multiple times in the multiset sum. For example, if the intervals are [5, 25], [3, 10], [8, 12], the multiset sum is {3, 4, 5, 5, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, . . . , 25}. Q: Given an integer x and the sets [a1, b1], . . . , [an, bn], design an efficient algorithm that outputs the number of elements in S less than x. What is the running time of the algorithm?
Correct answer will be upvoted else Multiple Downvoted. Computer science. Polycarp got the accompanying issue: given a framework piece of size 2×n, a few cells of it are obstructed. You want to check in case it is feasible to tile all free cells utilizing the 2×1 and 1×2 tiles (dominoes). For instance, if n=5 and the strip appears as though this (dark cells are obstructed) Polycarp handily tackled this errand and accepted his New Year's gift. Would you be able to settle it? Input The main line contains an integer t (1≤t≤104) — the number of experiments. Then, at that point, t experiments follow. Each experiment is gone before by a vacant line. The main line of each experiment contains two integers n and m (1≤n≤109, 1≤m≤2⋅105) — the length of the strip and the number of impeded cells on it. Every one of the following m lines contains two integers ri,ci (1≤ri≤2,1≤ci≤n) — numbers of lines and sections of hindered cells. It is ensured that all impeded cells are…
The game Capture is played by two players, First and Second, who take turns to move towards one another on a narrow bridge. Initially, the two players are at opposite ends of the bridge, at a distance of n feet from each other. (Here n is an arbitrary positive integer.) When it is their turn, they are allowed to jump 1, 2, or 3 feet toward each other. The game starts by First making a move first; the game is over when one player is able to capture (jump on top of) the other player. Generalize the problem further to the case when the initial distance is n feetand the players are allowed to jump any (positive) integer number of feet up to k feet. (Here n and k are arbitrary natural numbers.)