this question is about Automata Theory & Formal Languages lectures

notes for this question

1. Copy all the all the text before Note in this file and save in a text file

2. Read the saved text file into your program

3. Convert the read text into string (in case the text file is read as an object)

4. Use the split () method of string class to split the words in the text into a list data structure

5. Loop over the length of the list and check for the word which ends with ing

6. Save the accepted and not accepted words in separate container and display the results in the

   end of the scan.

7. it is okay to use any language

Q5. Write a program (java or python are preferred) which implement a DFA that scan the entire homework 1 document and accept only the language L= {w w is a string which ends with 'ing'}. Display both accepted and rejected strings