2. Write up an informal description of your chosen representation in a section of your README, labeled DFA Data Representation. For example, here's mine in Racket: DFA Data Representation: A State is a string A Symbol is a 1-char string A DFA is a (struct states alpha delta start accepts) where: - states is a list of State - alpha is a list of Symbol - delta is a hash of State Symbol -> Symbol - start is a State - accept is a list of State Note that structs, strings, lists, and hashes are data structures in my language. Your data representation will vary depending on your chosen language and the available constructs in that language. For example, if you're using Java, you might choose an Object instead of a struct.

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...
icon
Related questions
Question

Do the following code in any language you are comfortable

2. Write up an informal description of your chosen representation in a section of your
README, labeled DFA Data Representation.
For example, here's mine in Racket:
DFA Data Representation:
A State is a string
A Symbol is a 1-char string
A DFA is a (struct states alpha delta start accepts)
where:
- states is a list of State
- alpha is a list of Symbol
- delta is a hash of State Symbol -> Symbol
- start is a State
- accept is a list of State
Note that structs, strings, lists, and hashes are data structures in my language. Your
data representation will vary depending on your chosen language and the available
constructs in that language. For example, if you're using Java, you might choose an
Object instead of a struct.
Transcribed Image Text:2. Write up an informal description of your chosen representation in a section of your README, labeled DFA Data Representation. For example, here's mine in Racket: DFA Data Representation: A State is a string A Symbol is a 1-char string A DFA is a (struct states alpha delta start accepts) where: - states is a list of State - alpha is a list of Symbol - delta is a hash of State Symbol -> Symbol - start is a State - accept is a list of State Note that structs, strings, lists, and hashes are data structures in my language. Your data representation will vary depending on your chosen language and the available constructs in that language. For example, if you're using Java, you might choose an Object instead of a struct.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY