/automata

Deterministic Finite State Machine for a university project.

Primary LanguageC++MIT LicenseMIT

automata

Documentation

An implementation of a Deterministic Finite State Machine for a university project.

Features:

  • The FSM class is generic, so the alphabet can by of any type.
  • Define the FSM by prividing its possible states, initial state, final states and alphabet and check if a given input is recognized by the machine.
  • Union and intersection of two finite state machines.
  • Write an FSM to stdout or file.
  • Read an FSM using a CLI interface or load it from a file.

How to run

$ make
$ ./automata

Update the documentation

If you want to update the documentation, you can do so by running:

$ make documentation