Question

There is a regular expression below: ([0 − 9])∗55([0 − 9])∗ + ([0 − 9])∗77([0 −...

There is a regular expression below:

([0 − 9])∗55([0 − 9])∗ + ([0 − 9])∗77([0 − 9])∗ + ([0 − 9])∗8([0 − 9])∗8([0 − 9])∗8([0 − 9])∗ (contains 55, 77 or at least 3 8)

Build DFA M1 in JFLAP and show 2 strings accepted by M1 and 2 rejected by M1

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

For the given Regular Expression, this is the minimized DFA:

Here are the results:

(P.S. DFA is constructed in the JFLAP)

So, if you have any queries, feel free to ask in the comment box.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA...
Automata Theory and Formal Languages Instructions: Draw the DFA (Deterministic Finite Automaton) of the following: DFA which accepts strings of odd length Design a DFA over w ∈ {a,b}*such that number of a = 2 and there is no restriction over length of b DFA for Number of a(w) mod 2 = 0 and Number of b(w) mod 2 = 0 DFA for Number of a(w) mod 2 = 0 orNumber of b(w) mod 2 = 0 DFA for Number...
Which one of the following languages over the alphabet {0,1} is described by the regular expression...
Which one of the following languages over the alphabet {0,1} is described by the regular expression (0+1)* 0 (0+1)* 0 (0+1)* ? a.The set of all strings that begin and end with either 0 or 1 b.The set of all strings containing at most two zeros c.The set of all strings containing at least two zeros. d.The set of all strings containing the substring 00
Give a regular expression for the set of all strings on the alphabet {0,1} with no...
Give a regular expression for the set of all strings on the alphabet {0,1} with no runs of length greater than 3(for example, no substrings 0^i or 1^i with i > 3)
Show a regular expression representing the described set: a). The set of strings of odd length...
Show a regular expression representing the described set: a). The set of strings of odd length over {s,t,r,i,n,g} containing exactly 3 n's.
Provide direct answers. This question has been posted here by someone else before, but the answer...
Provide direct answers. This question has been posted here by someone else before, but the answer is unreadable and does not indicate clearly the answer. DO C. Let Lodd = {w ∈ {0, 1}∗ | w contains an odd number of 0s}. a) - What is L∗odd? (arrive at a direct description of this language that does not refer to Lodd). b) Then Start with a DFA recognizing Lodd, and use the construction we saw in class to obtain an...
Provide direct answers. This question has been posted here by someone else before, but the answer...
Provide direct answers. This question has been posted here by someone else before, but the answer is unreadable and does not indicate clearly the answer. DO A. Let Lodd = {w ∈ {0, 1}∗ | w contains an odd number of 0s}. a) - What is L∗odd? (arrive at a direct description of this language that does not refer to Lodd). b) Then Start with a DFA recognizing Lodd, and use the construction we saw in class to obtain an...
Find the maximum value of the expression given below on the horizontal span of 0 to...
Find the maximum value of the expression given below on the horizontal span of 0 to 6.    6x+7-x^2
Consider the data set below. xx 55 22 66 33 22 77 yy 99 22 99...
Consider the data set below. xx 55 22 66 33 22 77 yy 99 22 99 88 33 66 For a hypothesis test, where H0:β1=0H0:β1=0 and H1:β1≠0H1:β1≠0, and using α=0.01α=0.01, give the following: (a)    The test statistic t=t= (b)    The degree of freedom df=df= (c)    The rejection region |t|>|t|> The final conclustion is A. There is not sufficient evidence to reject the null hypothesis that β1=0β1=0. B. We can reject the null hypothesis that β1=0β1=0 and accept that β1≠0β1≠0.
Compute the payback statistic for Project A if the appropriate cost of capital is 9 percent...
Compute the payback statistic for Project A if the appropriate cost of capital is 9 percent and the maximum allowable payback period is four years. (Round your answer to 2 decimal places.) Project A Time: 0 1 2 3 4 5 Cash flow: −$3,000 $1,150 $1,080 $920 $700 $500 Should the project be accepted or rejected? accepted rejected
Compute the MIRR statistic for Project J if the appropriate cost of capital is 9 percent....
Compute the MIRR statistic for Project J if the appropriate cost of capital is 9 percent. (Do not round intermediate calculations and round your final answer to 2 decimal places.) Project J Time: 0 1 2 3 4 5 Cash flow –$2,000 $650 $1,980 –$620 $600 –$200 MIRR % Should the project be accepted or rejected? Accepted Rejected
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT