c with at least one a and at least one b)

0, 1 (c) The language { w ∈ Σ∗ w contains at least two 0s, or exactly two 1s } with six Answer: Let NFA N = (Q, Σ, δ, 1,F), where Q = {1, 2, 3}, Σ = {a, b}, 1 is

Obtain a DFA to accept strings of a's and b's starting with the string ab 9 UNIT 2 Finite Automata, Regular Expressions 1 P T Let R be a regular expression be empty, but at least one of the two strings of digits must be nonempty 14

(c) All strings in Σ* with exactly one occurrence of the substring aaa 4 Which of the (b) Any string of a's and/or b's with at least one occurrence of ab or ba 2

1 Give a context-free grammar (CFG) for each of the following languages over the alphabet Σ = {a, b}: (c) All strings with more a's than b's or more statements and other nested blocks, separated by semicolons, where the last semicolon is

A string is accepted by a NDFA, if at least one of all possible transitions ends in a final state a b c 0 0, 1 0 1 0, 1

The conditional probability of B given A can be found by assuming that event A has occurred and then calculating the probability that event B will occur Example

Problem 1 ¯ (b) All strings not ending in 01: + 0 + 1 + (0 + 1)*(00 + 10 + 11) or more ¯ (c) All strings containing an even number of 0's: 1*+ (1*01*0)*1* The first expression (1*01*0)*1* describes the strings with at least two 0's You need 

b begin with an odd digit? The first of 9 digits (not 4), similarly if the two 4s appear either in the e that contain at least one vowel if letters can be repeated ?

Continuity (a) Prove that the equation has at least one real root (b) Use your graphing device to find the root correct to three decimal places 1 arctan (x)=1 − x

+ Matches at least 1 time ? Matches at string \\b Empty string at either edge of a word