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
Given 2 regular expressions below (a) ([0−9])∗911([0−9])∗+([0−9])∗666([0−9])∗+([0−9])∗8888([0− 9])∗ (911,at least 4 consecutive 8, or 666) (b)...
Given 2 regular expressions below (a) ([0−9])∗911([0−9])∗+([0−9])∗666([0−9])∗+([0−9])∗8888([0− 9])∗ (911,at least 4 consecutive 8, or 666) (b) ([0 − 9])∗55([0 − 9])∗ + ([0 − 9])∗77([0 − 9])∗ + ([0 − 9])∗8([0 − 9])∗8([0 − 9])∗8([0 − 9])∗ (55, 77 or at least 3 8) Build DFAs M1 M2 for (a) and (b) in JFLAP(okay if on paper might help)
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...
1. The alphabet for generating DNA sequences is {A, T, G, C}. Write a regular expression...
1. The alphabet for generating DNA sequences is {A, T, G, C}. Write a regular expression that represents all DNA strings that begin with ‘A’ and end with ‘T’. Note: assume empty string is not a valid string. 2. Please submit the regular expression and Diagram of the DFA. I will be creating C++ code that extracts patterns that begin with 'A' and end with 'T' , but I need help with the visual representation. Thank you! example Input: CATTGCAGGTG...
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
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over...
Problem 5 Regular Expressions. a) Define a regular expression for all strings of odd length, over the alphabet of {0}. b) Define a regular expression for identifiers over the alphabet of {A,B,C,a,b,c,0,1,2,3,4,5,6,7,8,9}, such that an identifier must begin with an alphabetic character and must contain at least one numeric character. c) Try to modify the definition above so that identifiers still begin with an alphabetic character, but after that, it must contain at least one numeric, at least one lower-case...
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.
Let Σ = {0, 1}. Give a regular expression that expresses the language {w | w...
Let Σ = {0, 1}. Give a regular expression that expresses the language {w | w contains exactly two 0s}.
3. (15 pt.) Prove that the class of regular languages is closed under intersection. That is,...
3. (15 pt.) Prove that the class of regular languages is closed under intersection. That is, show that if ? and ? are regular languages, then ? ∩ ? = {? | ? ∈ ? ??? ? ∈ ?} is also regular. Hint: given a DFA ?1 = (?1 , Σ, ?1 , ?1 , ?1) that recognizes ? and a DFA ?2 = (?2 , Σ, ?2 , ?2 , ?2) that recognizes ?, construct a new DFA ?...
Create a Regular Expression for the following: The set of all signed or unsigned integers and...
Create a Regular Expression for the following: The set of all signed or unsigned integers and real numbers in decimal notation. No leading zeros should be generated, and real numbers must have at least one digit on both sides of the decimal point. For instance, 3, +3, -3, 0,+0, -0, 0.328, 1009.46, +100.80 and -100.3 are in the language but 123., .25, +, -, 003 are not.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT