Q2: Describe the following regular expressions using set builder notation then show the equivalent NFA( show the stages of the NFA creation).
1) ?∗101?∗ where ? = {0,1}
2) ?∗(??+)∗
3) 01* ∪ 10*
Q2: Describe the following regular expressions using set builder notation then show the equivalent NFA( show...
1. Write regular expressions to capture the following regular languages: (a) The set of binary strings which have a 1 in every even position. (Note: odd positions may be either 0 or 1.) (b) The set of binary strings that do not contain 011 as a substring. (c) Comments in Pascal. These are delimited by (* and *) or by { and }, and can contain anything in between; they are NOT allowed to nest, however. 2. Write a DFA...
Provide regular expressions for the following languages: a.) The set of strings over {0,1} whose tenth symbol from the right end is 1. b) The set of strings over {0,1} not containing 101 as a sub-string. ***IMPORTANT: PLEASE SHOW ALL WORK AND ALL STEPS, NOT JUST THE ANSWERS!!!
) Solve the inequality. Write the answer using both set-builder notation and interval notation. Graph the solution set on a number line. Multiply both sides of the inequality by the LCD first to clear fractions. 3/4 x+1/2<1/3 x+2
a)
b)
c)
d)
The interval notation (-3, 1) described in set builder notation is {* | -3 5xs1} {x-3<x<1) {x-35x<1} {x|-3<x51} The set-builder notation {xl-55x<8} is equivalent to (-5,8) O(-5, 8] O [-5,8) O [-5, 8] To solve 2x - 11<3, one must consider only one case two different cases three different cases O four different cases If f(x) = 3x2 and g(x) = x + 2, then (gf)(x) is 3x2 + 2 3x3 + 6x2 03x2 + x...
Regular expressions, DFA, NFA, grammars, languages
Regular Languages 4 4 1. Write English descriptions for the languages generated by the following regular expressions: (a) (01... 9|A|B|C|D|E|F)+(2X) (b) (ab)*(a|ble) 2. Write regular expressions for each of the following. (a) All strings of lowercase letters that begin and end in a. (b) All strings of digits that contain no leading zeros. (c) All strings of digits that represent even numbers. (d) Strings over the alphabet {a,b,c} with an even number of a's....
1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. (6 points) a. bac + bc b. b*ac + bc C. b*ccca* a. 2. Find a regular expression to describe the given language: {b, ac, bac, bc, ..., b”ac, bc”, ... } (3 points)
Define by using the set-builder notation by using the condition as predicate logic. We can only use these operations + and * 1) Nonnegative numbers that are divisors of 42. 2) The set pairs of consecutive integers that are even. For example (24, 26) or (30, 28) - These pairs would hold. What I have is this: 1. {x | x * y = 42, x,y ∈ N} or {x | (x,y) ∈ N*N and x*y = 42} 2. { (2x,2y) |...
Convert the following NFA to a Regular Grammar using the algorithm discussed in Week 3 lecture video/slides. Upload Please see exercise Qs for sample solutions. 3 2
Let U be the set of all integers. Consider the following sets: S is the set of all even integers; T is the set of integers obtained by tripling any one integer and adding 1; V is the set of integers that are multiples of 2 and 3. a) Use set builder notation to describe S, T and V symbolically. b) Compute s n T, s n V and T V. Describe these sets using set builder notation