CS250      Lab1 - Deterministic Finite Automata

Objectives:

• Become familiar with JFLAP
• Understand how DFAs function
• Be able to construct DFA to recognize specific languages
• Begin thinking about the properties of regular languages

1. Download the lab1 files and start JFLAP 6.0.  JFLAP comes with easy to follow Help instructions and there is a JFLAP tutorial. Once it is running, select the Finite Automaton button to bring up the FA editor.  Open the file ex1.1.  You may execute this DFA in several ways.  Test out the step by state, fast run, and multiple run options.
    

   Clearly and succinctly describe the language that is accepted by the DFA in ex1.1

    

2. You can open a new editor window and construct your own DFA.  There are tools for creating states, transitions, and deleting them.  A right click on a state will allow you to select it as an initial and/or final state.
    

   Build and thoroughly test DFAs for the exercises 2a,b,d, 9b,c on p47 of your text.

    

3. Any language that can be accepted by a DFA is called a regular language. 
    

   Show that if L is a regular language then L-{l} is regular as well.  You can do this by describing how you would modify a DFA which accepts L so that you get another DFA which accepts L-{l}.