JFLAP is a software tool for experimenting with formal languages and automata theory. It was developed at Duke University to teach topics related to computational theory. The document describes using JFLAP to design deterministic finite automata for strings with an odd number of 0s or even number of 1s, and strings with an odd number of 0s and even number of 1s. The automata are implemented and tested on different strings using the JFLAP tool.

1. 20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 3
PRACTICAL - 1
Aim: Explore the JFLAP Tool to demonstrate the deterministic finite automata for the following and
also find its Regular expression.
1)Odd number of 0’a or Even number of 1’s
2)Odd number of 0’a and Even number of 1’s
Theory:
JFLAP, which stands for "Java Formal Language and Automata Package," is a powerful
software tool designed for teaching and experimenting with various topics related to formal languages,
automata theory, and computational theory. It was developed by Susan H. Rodger and her colleagues
at Duke University and is widely used in computer science and theoretical computer science education.
Output:
1)Odd number of 0’a or Even number of 1’s

2. 20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 4
2)Odd number of 0’a and Even number of 1’s
Conclusion: In this practical we implement two different deterministic finite automata using JFLAP
tool and test many strings.
Grade:
Signature:
Remarks: