Your task for this exploration is to create several differentautomaton and corresponding test sets in JFLAP, a software packagefor “experimenting with formal language topics”. Specifically, yourtasks are:
A. create an accepter (a Turing machine which ends inan accept state when given a string that is in the language) inJFLAP to recognize C1={0n12n23n | n≥0}C1={0n12n23n | n≥0}. AssumeΣ={0,1,2}Σ={0,1,2}.
- For instance, if the input string is 011222011222, the Turingmachine would accept.
- If the input string was 0112201122, the Turing machine wouldreject
B. create at least 10 strings to test your accepter andsave them to a file in the format accepted for multiple runs inJFLAP.
C. create a
OR
OR