Consider the following automaton (DFA machine): b b 91 92 a a S b Ti 12...

  

Transcribed Image Text:

Consider the following automaton (DFA machine): b b 91 92 a a S b Ti 12 b b a For the above automaton write a computer program (any programming language is OK) that can process strings which use symbols from the corresponding alphabet and applying the above machine. Show how 5 strings are accepted and how 5 other strings are not accepted. Clearly show how a string is being processed and which states are visited while processing these strings. You choose the strings to demonstrate the above. If you use code that you did not write but found in some kind of library, clearly mark that part of your code or the case will be considered as plagiarism (and thus academic misconduct). Submit your code, how it can run, and screen shots that demonstrate how your 5 + 5 strings are accepted or rejected by the machine. Consider the following automaton (DFA machine): b b 91 92 a a S b Ti 12 b b a For the above automaton write a computer program (any programming language is OK) that can process strings which use symbols from the corresponding alphabet and applying the above machine. Show how 5 strings are accepted and how 5 other strings are not accepted. Clearly show how a string is being processed and which states are visited while processing these strings. You choose the strings to demonstrate the above. If you use code that you did not write but found in some kind of library, clearly mark that part of your code or the case will be considered as plagiarism (and thus academic misconduct). Submit your code, how it can run, and screen shots that demonstrate how your 5 + 5 strings are accepted or rejected by the machine.

Answer rating: 100% (QA)

The image contains a diagram of a deterministic finite automaton DFA with transitions labeled as either a or b The DFA has five states labeled S q1 q2 ... View the full answer