Design a deterministic finite-state automaton (DFA) that accepts exactly the strings over the alphabet {A, B, ...,Z} that contain at least two R, at most one T, and where every E comes after some S (there may be other letters in between). For instance, your DFA should accept the strings: • MYSTICWARRIORS MARSMATRIX SHOCKTROOPERS • CONTRAHARDCORPS STRIDER but not the strings CRAZYTAXI (it does not contain at least two Rs) LASTRESORT (it contains more than one T) AFTERBURNER (there are Es without a S somewhere before them) • BATTLECIRCUIT (all of these at the same time) Clearly indicate the meaning of each state. One way to do this is to number the states and have a numbered list of their meanings, but any readable method you use to label and explain your states is fine. Hint: there are three separate conditions accepted strings must meet; states will need to encode whether or not each one is met (or perhaps partially met). You can label an edge with the word "else" to indicate it would contain every character that does not appear on another edge leaving from the same state. For instance, if a state has outgoing edges labeled "E", "R", "S, "T" and "else", then "else" stands for "A, B, C, D, F, G, H, I, J, K, L, M, N, O, Q, U, V, W, X, Y, Z".
Design a deterministic finite-state automaton (DFA) that accepts exactly the strings over the alphabet {A, B, ...,Z} that contain at least two R, at most one T, and where every E comes after some S (there may be other letters in between). For instance, your DFA should accept the strings: • MYSTICWARRIORS MARSMATRIX SHOCKTROOPERS • CONTRAHARDCORPS STRIDER but not the strings CRAZYTAXI (it does not contain at least two Rs) LASTRESORT (it contains more than one T) AFTERBURNER (there are Es without a S somewhere before them) • BATTLECIRCUIT (all of these at the same time) Clearly indicate the meaning of each state. One way to do this is to number the states and have a numbered list of their meanings, but any readable method you use to label and explain your states is fine. Hint: there are three separate conditions accepted strings must meet; states will need to encode whether or not each one is met (or perhaps partially met). You can label an edge with the word "else" to indicate it would contain every character that does not appear on another edge leaving from the same state. For instance, if a state has outgoing edges labeled "E", "R", "S, "T" and "else", then "else" stands for "A, B, C, D, F, G, H, I, J, K, L, M, N, O, Q, U, V, W, X, Y, Z".
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Design a deterministic finite state automaton (DFA) that accepts exactly
the strings over the alphabet {A, B, ...,Z} that contain at least two R, at most one T, and
where every E comes after some S (there may be other letters in between). For instance,
your DFA should accept the strings:
• MYSTICWARRIORS
• MARSMATRIX
• SHOCKTROOPERS
• CONTRAHARDCORPS
STRIDER
but not the strings
• CRAZYTAXI (it does not contain at least two Rs)
LASTRESORT (it contains more than one T)
AFTERBURNER (there are Es without a S somewhere before them)
• BATTLECIRCUIT (all of these at the same time)
Clearly indicate the meaning of each state. One way to do this is to number the states
and have a numbered list of their meanings, but any readable method you use to label
and explain your states is fine.
Hint: there are three separate conditions accepted strings must meet; states will need to
encode whether or not each one is met (or perhaps partially met).
You can label an edge with the word “else" to indicate it would contain every character
that does not appear on another edge leaving from the same state. For instance, if a state
has outgoing edges labeled "E", "R", "S", "T" and "else", then "else" stands for "A, B, C,
D, F, G, H, I, J, K, L, M, N, O, Q, U, V, W, X, Y, Zr.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY