Question

C++ DFA simulator A deterministic finite automaton (DFA) - also known as deterministic finite state machine - is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation (or run) of the automaton for each input string. Write a DFA simulator using the C++ programming language. Please refer to the following UDACITY website if you do not know C++. This is a free online tutorial for learning C++. https:www.udacity.com/course/c-for-programmers--ud210 1. Read your DFA from a textfile. First line contains a list of the final states (as integers), separated by a space. Rest of file contains the transitions in form: startstate, blank, symbol read, blank, to state 2. Prompt user for name of file. 3. From there, program prompts the user for strings to test for acceptance on DFA. 4. Show the trace of the transitions through the machine along with whether the string is accepted or rejected. 5. Continue reading strings until user enters "quit." Example input file... (ab)* 0 0a1 ob2 1a2 1b0 2a2 2b2 Files to Upload Upload a total of five (5) files: c++ file; output file (text file); input file (textile containing the DFa); a diagram of the DFA; a screen shot illustrating that your code compiled correctly with timestamp.

          C++ DFA simulator
A deterministic finite automaton (DFA) - also known as deterministic finite
state machine - is a finite state machine that accepts/rejects finite strings of
symbols and only produces a unique computation (or run) of the automaton
for each input string.
Write a DFA simulator using the C++ programming language. Please refer
to the following UDACITY website if you do not know C++. This is a free
online tutorial for learning C++.
https:www.udacity.com/course/c-for-programmers--ud210
1. Read your DFA from a textfile. First line contains a list of the final
states (as integers), separated by a space. Rest of file contains the
transitions in form: startstate, blank, symbol read, blank, to state
2. Prompt user for name of file.
3. From there, program prompts the user for strings to test for
acceptance on DFA.
4. Show the trace of the transitions through the machine along with
whether the string is accepted or rejected.
5. Continue reading strings until user enters "quit."
Example input file... (ab)*
0
0a1
ob2
1a2
1b0
2a2
2b2
Files to Upload
Upload a total of five (5) files: c++ file; output file (text file); input file
(textile containing the DFa); a diagram of the DFA; a screen shot
illustrating that your code compiled correctly with timestamp.

C++ DFA simulator
A deterministic finite automaton (DFA) - also known as deterministic finite
state machine - is a finite state machine that accepts/rejects finite strings of
symbols and only produces a unique computation (or run) of the automaton
for each input string.
Write a DFA simulator using the C++ programming language. Please refer
to the following UDACITY website if you do not know C++. This is a free
online tutorial for learning C++.
https:www.udacity.com/course/c-for-programmers–ud210
1. Read your DFA from a textfile. First line contains a list of the final
states (as integers), separated by a space. Rest of file contains the
transitions in form: startstate, blank, symbol read, blank, to state
2. Prompt user for name of file.
3. From there, program prompts the user for strings to test for
acceptance on DFA.
4. Show the trace of the transitions through the machine along with
whether the string is accepted or rejected.
5. Continue reading strings until user enters "quit."
Example input file... (ab)*
0
0a1
ob2
1a2
1b0
2a2
2b2
Files to Upload
Upload a total of five (5) files: c++ file; output file (text file); input file
(textile containing the DFa); a diagram of the DFA; a screen shot
illustrating that your code compiled correctly with timestamp.

Added by Nicholas M.

Question

Please give Ace some feedback