Create a deterministic state diagram which accepts all binary strings in the following set (and rejects all others): {w w does not contain an even-length run of Os} (A "run" is a maximal group of consecutive identical symbols, so e.g. 0000010 consists of a length-5 run of Os followed by a length-1 run of 1s and then a length-1 run of Os. Examples for your state diagram: &, 11, 00000, and 00010110001 should all be accepted, while 00 and 11100101000 should be rejected. A string is "accepted" if the state diagram ends up in a Goal State (aka "end", "final", or "accepting" state) after the whole string is read, and the string is rejected otherwise.) Hint: it is possible to solve this using just 4 states, though you are welcome to use more.

Create a deterministic state diagram which accepts all binary strings in the following set (and rejects all others): {w w does not contain an even-length run of Os} (A "run" is a maximal group of consecutive identical symbols, so e.g. 0000010 consists of a length-5 run of Os followed by a length-1 run of 1s and then a length-1 run of Os. Examples for your state diagram: &, 11, 00000, and 00010110001 should all be accepted, while 00 and 11100101000 should be rejected. A string is "accepted" if the state diagram ends up in a Goal State (aka "end", "final", or "accepting" state) after the whole string is read, and the string is rejected otherwise.) Hint: it is possible to solve this using just 4 states, though you are welcome to use more.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question: For each of the below three problems, draw the state diagram of a pushdown automaton. (a) {ww starts and ends with same symbol } (b) {w the length of w is odd } (c) {w\w = WR, i.e., w is a palindrome }. For instance the word noon is a palindrome because reversing the letters results in the same word.
Write pseudo code for it & what conditions) what else should change in Semigroup computation on a PRAM algorithm? to avoid the final broadcasting phase which essentially doubles the execution time of the semigroup computation algorithm in the EREW PRAM, it has been suggested that we replace the indices j + s in the algorithm with j + s mod p (i.e., allow the computations to wrap around). And under what conditions would this method yield correct results in all processors? (Write pseudo code for it)
Exercise 13 Name: 11.5 (Multiplicative ElGamal). Let G be a cyclic group of prime order q generated by g € G. Consider a simple variant of the ElGamal encryption system EMEG = (G. E, D) that is defined over (G. G²). The key generation algorithm G is the same as in EEG, but encryption and decryption work as follows: ⚫ for a given public key pku G and message mЄ G: E(pk, m) := eum, output (v, e) ⚫ for a given secret key sk= a € Zq and a ciphertext (v,e) € G²: D(sk, (v, e)) e/v Show that EMEG has the following property: given a public key pk, and two ciphertexts C1E(pk, m) and c2 E(pk, m2), it is possible to create a new ciphertext e which is an encryption of m₁ m2. This property is called a multiplicative homomorphism.
Suppose (X[mX]+Y [mY ]) > 0. What can you infer about each of the four subproblems (namely, (X1, Y1), (X1, Y2), (X2, Y1), and (X2, Y2))? Clearly identify the ones that do not have to solved anymore, and those that still have to be solved. Briefly justify.
Let us define a sequence parity function as a function that takes in a sequence of binary inputs and returns a sequence indicating the number of 1’s in the input so far; specifically, if at time t the 1’s in the input so far is even it returns 1, and 0 if it is odd. For example, given input sequence [0, 1, 0, 1, 1, 0], the parity sequence is [0, 0, 0, 1, 0, 0]. Implement the minimal vanilla recurrent neural network to learn the parity function. Explain your rationale using a state transition diagram and parameters of the network.
Use the Pumping lemma to prove sets not context free: 1. Show this set is not context free: A={a^n b^m c^p | n > m >p > 0}. 2. Show this set is not context free: B={w rev(w) w | w ∈ {a,b}*}. 3. Show this set is not context free: C = {w ∈ {a,b,c,d}* | #a(w) = #b(w) and #c(w) = #d(w)}.
Practice 3: Let’s compile following C sequence for MIPS and run on the emulator: int divide(int N, int M) { // map q and i to $s2 and $s3 int q = 0; int i = N; while(i > 0) { q += 1; i = i - M; } return q; } int multiply(int N, int M) { // map sum and i to $s0 and $s1 int sum = 0; for(int i = 0; i < N; ++i) { sum += M; } return sum; } int main() { // map a, b, c, k, and j to $s0, $s1, $s2, $s3, and $s4 int a = 4; int b = 5; int c = 120; int k = multiply(a, b); int j = divide(c, k); } Make sure multiply procedure properly gets backup of $s0 to $s4. Verify that after running this sequence: • value of S0 is (4)10 • value of S1 is (5)10 • value of S2 is (120)10 • value of S3 is (20)10 • value of S4 is (6)10 When ready, copy your MIPS assembly code from emulator and save as a text file.
13. Draw a deterministic FSM that recognizes strings of 1’s and 0’s specified by each of thefollowing criteria. Each FSM should reject any characters that are not 0 or 1. *(a) The stringof three characters, 101. (b) All strings of arbitrary length that end in 101. For example, theFSM should accept 1101 but reject 1011. (c) All strings of arbitrary length that begin with 101.For example, the FSM should accept 1010 but reject 0101.
JUST DRAW IN JFLAP AND PROVIDE RUNTINE < NO EXPLANATION> Write a one-tape deterministic Turing machineusing JFLAP to implement the BubbleSort algorithm. The input alphabet ∑ = {a, b}. When the computation halts, the contents of the tape should be in “sorted order” (i.e., all a’s appear to the left of all b’s). The Turing Machine should scan the tape from left-to-right, swapping any pair of adjacent items that are out-of-order. Then the Turing Machine should repeat this scan again. If the entire string is scanned, and no items are swapped, then the computation can halt. What is the big-Oh running time of your Turing Machine, given an input string of n symbols?
When the DFA minimization algorithm merges states p and q, then a) p and q are dead-end states b) p is distinguishable from q c) p and q are start states d) p is equivalent to q e) p and q are not reachable from the start state
Give the best possible asymptotic upper bound for the following code block. Explain your answer in detail. i = 1; while(i < n){ i = i*2; j = 1; while(j < i){ j = j*3; k = 1; while(k < j){ k = k*4; } } }
Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and study its performance using different graphs. Side note- Below I have attached Floyd's Algorithm for Shortest Paths. please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- -description of the java file -what it does? -what is the input data? expected output, samples of both