Can you please help me go through these problems? 1. Draw a deterministic finite automaton (DFA) for each of the following sets. Remember to always indicate the start and accept states. Try to avoidintroducing redundant states. Use state labels where they would be helpful to indicate the meaning of a state.a. The set of strings in {a, b}* containing a substring of four consecutive b's, eg, strings bbbb, abbabbbb, abbbbab, etc, should be accepted.b. The set of strings in {a}* whose length is evenly divisible by either 3 or 5, eg, aaa, aaaaa, aaaaaa, etc, should be accepted.c. The set of strings in {0, 1}* containing an odd number of Os and an even number of 1s, eg, strings 0, 011, 01010, etc, should be accepted.d. The set of strings in {a, b}* containing at least 2 occurrences of 3 consecutive a's, overlapping permitted, eg, string aaaa should be accepted, as wellas longer strings such as baaababaaab.e. The set of strings in {0, 1, 2}* that are ternary (base 3) representations, leading zeros permitted, of numbers that are not multiples of four (considerthe null string a representation of zero). For example, accepted strings would include 1, 2, 10, 12 (not multiples of four in ternary), whereas rejectedstrings would include 0, 11, 22, 121, etc, (multiples of four in ternary).2. Consider the following two deterministic finite automata with states {1, 2} and input alphabet {a, b}.a ba b--> 1 12 22F 11 1--> 1 11 22F 12 1Use the product construction to give deterministic automata accepting (a) the intersection, and (b) the union of the two sets accepted by theseautomata. Submit drawings of both.3. a. Depict with a drawing the DFA with states Q = {0, 1, 2, 3, 4}, input alphabet {0, 1}, start state 0, final state 0, and transition function8(q, i) (q²i) mod 5, q € Q, i = {0, 1}.=b. What set of bit strings does this DFA accept?

In this question we have to design a Deterministic Finite Automata for each of the following sets.…

1. Draw a deterministic finite automaton (DFA) for each of the following sets. Remember to always indicate the start and accept states. Try to avoid introducing redundant states. Use state labels where they would be helpful to indicate the meaning of a state. a. The set of strings in {a, b}* containing a substring of four consecutive b's, eg, strings bbbb, abbabbbb, abbbbab, etc, should be accepted. b. The set of strings in {a}* whose length is evenly divisible by either 3 or 5, eg, aaa, aaaaa, aaaaaa, etc, should be accepted. c. The set of strings in {0, 1}* containing an odd number of Os and an even number of 1s, eg, strings 0, 011, 01010, etc, should be accepted.

1. Draw a deterministic finite automaton (DFA) for each of the following sets. Remember to always indicate the start and accept states. Try to avoid introducing redundant states. Use state labels where they would be helpful to indicate the meaning of a state. a. The set of strings in {a, b}* containing a substring of four consecutive b's, eg, strings bbbb, abbabbbb, abbbbab, etc, should be accepted. b. The set of strings in {a}* whose length is evenly divisible by either 3 or 5, eg, aaa, aaaaa, aaaaaa, etc, should be accepted. c. The set of strings in {0, 1}* containing an odd number of Os and an even number of 1s, eg, strings 0, 011, 01010, etc, should be accepted.

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

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.
Give a DFA over {a,b} that accepts all strings of length exactly 5 For each state in your automaton, give a brief description of the strings associated with that state.
Convert the following DFA to an equivalent regular expression: Deterministic finite automaton a 93 a b b b a q2 q1 b a 44 Grafstate® M 1. Create an initial GNFA GO that is equivalent to M. Here are suggested steps: a. Choose a state in Q. Modify GO to create an equivalent GNFA called G1 that contains all states in GO except for the state you chose. b. Choose another state in Q. Modify G1 to create an equivalent GNFA called G2 that contains all states in G1 except for the state you chose. c. Choose another state in Q. Modify G2 to create an equivalent GNFA called G3 that contains all states in G2 except for the state you chose. d. Choose another state in Q. Modify G3 to create an equivalent GNFA called G4 that contains all states in G3 except for the state you chose.
Correct answer will be upvoted else downvoted. Computer science. string a matches an example b if for every I from 1 to k either bi is a special case character or bi=ai. You are approached to improve the examples so that the primary example the j-th string matches is p[mtj]. You are permitted to leave the request for the examples unaltered. Would you be able to perform such an improvement? Assuming you can, print any legitimate request. Input The primary line contains three integers n, m and k (1≤n,m≤105, 1≤k≤4) — the number of examples, the number of strings and the length of each example and string. Every one of the following n lines contains an example — k characters that are either lowercase Latin letters or highlights. All examples are pairwise unmistakable. Every one of the following m lines contains a string — k lowercase Latin letters, and an integer mt (1≤mt≤n) — the record of the main example the relating string should coordinate. Output Print "NO"…
Q3. Let E = {a, b}. Let BDFA = {(M)| M is a DFA that accepts some string containing an equal number of as and bs). Show that BDFA is decidable. (Hint: remember the different results/theorems about CFLs, provide a semi-formal discussion/argument)
(a) Give a regular expression that describes all strings accepted by the automaton. (b) Use a subset construction to construct DFA that accepts the same language. Clearly specify the transition table and the start and accepting states. (c) Explain concisely how you can use reachability in the graph to reduce the number of states as much as possible. You might need to draw the unreduced DFA first (for yourself, no need to submit) to better see what is going on. How many states do you end up with? Draw the resulting DFA (with the reduced number of states).
Draw a deterministic FSM that recognizes strings of 1’s and 0’s specified by each of the following criteria. Each FSM should reject any characters that are not 0 or 1. *(a) The string of three characters, 101. (b) All strings of arbitrary length that end in 101. For example, the FSM 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. (d) All strings of arbitrary length that contain a 101 at least once anywhere. For example, the FSM should accept all the strings mentioned in parts (a), (b), and (c), as well as strings such as 11100001011111100111.
Given two strings X and Y, where X consists of the sequence of symbols X1, X2, Xm and Y consists of the sequence of symbols y₁,Y2, ***,yn. Consider the sets {1, 2, ..., m} and {1, 2, ..., n} as representing the different positions in the strings X and Y, and consider a matching of these sets, where a matching is a set of ordered pairs with the property that each item occurs in at most one pair. A matching M of these two sets is an alignment if there are no "crossing" pairs: if (i,j). (i*,j') = Mandi 0 that defines a gap penalty. For each position of X or Y that is not matched in M (it is a gap), we incur a cost of 8. Second, for each pair of letters p and q (p + q) in our alphabet, there is a mismatch cost of app for lining up p with q. Thus, for each (i,j) = M, we pay the appropriate mismatch cost axiy for lining up x; with y;. The cost of M is the sum of its gap and mismatch costs, and the problem seeks an alignment of minimum cost. Define the minimum alignment cost OPT(i,j) (0 ≤ i ≤…
Must be new solution and run on GNU Common Lisp! Using Lisp, write a program that solves the Missionaries and Cannibals problem that uses a DFS( depth first search). It should use (mac start end). Start is the current state (which can be (3 3 l) and End is the goal state (which can be (0 0 r). This should output the sequences of moves needed to reach the end state from the start state. This should print nil if there is no solution. For example, the call should be something like this! Call: (mac '(3 3 l) '(0 0 r)) Output: ((3 3 l) (2 2 r) (3 2 l) (3 0 r) (3 1 l) (1 1 r) (2 2 l) (0 2 r) (0 3 l) (0 1 r) (1 1 l) (0 0 r))
Let A={+,x,a,b}. Show that (a*V ba)+ b is regular over A.
Subject - Theory of Computing Please do no. 3 & no 4 and make sure you write the no for wich one you provided answer. Thanks in advance 3. Let S={ab, bb} and T={ab, bb, bbb}. Show that S*≠T* but that S*⊂T*.4. Write the regular expression for the language of all strings, over alphabet {a, b}, that end in a double letter, i.e. ending in aa or bb but not ab or ba5. Draw Deterministic Finite Automata to accept the following sets of strings, over the alphabet {0,1}, that contain exactly four 0s (not necessarily consecutive zeros) 6. Write the regular expression for the language of all strings, over alphabe that end t {0, 1}, the set of all strings in which every pair of adjacent zeros appears before any pair of adjacent ones. Justify
Let P and Q be predicates on the set S, where S has two elements, say, S = {a, b}. Then the statement VxP(x) can also be written in full detail as P(a) A P(b). Rewrite each of the statements below in a similar fashion, using P, Q, and logical operators, but without quantifiers. (a) Vx,y (P(x) ^ Q (y)) (b) Vx3y (P(x) v Q (y)) (c) 3x P(x)^3y Q(y) (d) ³xvy (P(x) ^ Q (y))