use Java. Project description Purpose: To model a DFA (Deterministic Finite Automaton) and use it to accept strings of the associated language. Input: The program should take the DFA description from a text file that is specified as a command line parameter. If this parameter is missing, the user should be prompted for the data file. Strings to be tested for inclusion in the language should be entered interactively by the user. Output: For each string being tested, the program should indicate whether or not the string is accepted. DFA input format: line 1: alphabet - eg. {0,1} line 2: states - eg. {a,b,c,d,e} line 3: start state - eg. a line 4: accept states - eg. {d,e} lines 5-: transition fn - eg. (a,0)->b (a,1)->c etc. Notes: Assume no spaces in input. Alphabet must at least allow {0,1}. Please feel free to expand this. States must at least allow lower case letters, but you are welcome to expand this to numerals and upper case letters. Transition functions may appear in any order in the input text file. End of the input file indicates the end of transition functions.
use Java.
Project description
Purpose: To model a DFA (Deterministic Finite Automaton) and use it to accept strings of the associated language.
Input: The
Output: For each string being tested, the program should indicate whether or not the string is accepted.
DFA input format:
|
line 1: alphabet - |
eg. {0,1} |
|
line 2: states - |
eg. {a,b,c,d,e} |
|
line 3: start state - |
eg. a |
|
line 4: accept states - |
eg. {d,e} |
|
lines 5-: transition fn - |
eg. (a,0)->b |
|
|
(a,1)->c |
|
|
etc. |
Notes:
- Assume no spaces in input.
- Alphabet must at least allow {0,1}. Please feel free to expand this.
- States must at least allow lower case letters, but you are welcome to expand this to numerals and upper case letters.
- Transition functions may appear in any order in the input text file. End of the input file indicates the end of transition functions.
Step by step
Solved in 3 steps with 1 images
