finite state automaton

Fulfilled by: Zadorin DmitryGroup 372 SE

dmzadorin@gmail.com

Scientific adviser: Avdoshin S.M

Subject: Finite state automata minimization

A finite state automaton (plural: automata), or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions.

Automaton can be represented as state diagram or state transition table

Automaton example

12.04.23

State transition table State diagram

12.04.23

Minimization creates automat that is similar to the original one

But this new automaton has less states

12.04.23

Similar states When we have some similar states –

states that are doing alike workThe smaller – the faster.

The smaller is the automaton the faster it can execute operations

12.04.23

Automate minimization techniqueUnderstanding minimization processExplain the basis of automata

Program is written on the csharp (C#) programming language

Program requires .Net 2.0 or higher installed

12.04.23

12.04.23

12.04.23

12.04.23

12.04.23