/about fistau

What is a Finite State Automaton?

Finite state automata (FSA) are abstract machines used in various applications. They can be represented as graphs, with nodes representing states and arrows representing transitions between states.

Different types of FSA exist, including Mealy machines, Moore machines, and Markov chains.

Fistau is a tool that allows the creation and representation of Mealy machines, which can also be used to represent Markov processes by adding probabilities to transitions.

Fistau simplifies the representation of processes by using a transition matrix and presetting unused spaces to go to an error state.

The Fistau process

The deliverable includes a C source file, a header file, and a .fistau file for defining the state machine. The source code can be customized and compiled with a testing option.

The implementation uses edge names for character transitions and node names for function definitions. The .fistau file stores the graph definition for future use. The resulting code has no IP restrictions.