This program is an Finite-state automaton (FSA) editor.

All the information come from Instruction/Projet.

The program need to contains the following features :

• FSA Editing, which means :
  • Adding
  • Importation/Exportation with a file
  • Editing
  • Removing
• Check if a word can be read by the FSA
• Check if an AEF is complete
• Transform an AEF into an complete AEF
• Check if an AEF is deterministic
• Transform an AEF into a deterministic one
• Do the folow operation
  • Complement of an AEF
  • Mirror of an AEF
  • Product of two AEFs
  • Concatenation of two AEFs
• Extract a regular expression from an AEF. For example, a*b is a regular exepression.
• Find AEF admited language. For example, {a*b} is a language
• Check if two AEF are equivalent (they recognized same language)
• Transform an AEF into an trim one
• Transform an AEF into a minimal one. The new AEF will recognized the same language, with the minmal number of state. Which means that no state can be removed from the AEF and without change the know language
• The interface need to be in the shell

• Export the FSA in an image (.png)
• A GUI for editing the FSA (JFLAP)

The program use the .oto extension to save your Finite-State automaton. The strucuture is the same as a CSV file with the follow header :

Header : Names of the state, first event, second event, thrid event, [...], EI, EF
EI: Etat Initial (0 : false, 1: true)
EF: Etat Final (0 : false, 1: true)
Note: The "Names of the state" column is "etat"

Example 1 :
This example represent an AEF reading an binary number with an even number of 1

even.csv

etat;0;1;EI;EF
q_even;q_even;q_odd;1;1
q_odd;q_odd;q_even;0;0

We can represent this AEF with the folowing graph :

Example 2 :
Other abstract example :

abstract.csv

etat;a;b;c;d;e;f;g;h;i;k;EI;EF
q0;q0;;;;;q1;;;;;1;1
q1;;q1;;;;;q2;;;;0;0
q2;;;q2;;;;;q3;;;0;1
q3;;;;q3;;;;;q4;q0,q1;0;0
q4;;;;;q4;;;;;;0;1

We can represent this AEF with the folowing graph :

You will find more examples in Sample/Examples