Java

Finite State Automata and Regular Expressions

This project explores the implementation of finite state machines and has two parts.

1) Write a program that starts by asking the user to describe a finite state automaton. You then display a regular expression describing the strings accepted by this FSA.

2) Write a program that takes a regular expression as an input and describes the FSA associated with the expression.

For both parts, allow the user to enter a bit string and have your program determine whether it is accepted or rejected by their FSA or regular expression.