finite state automaton
DESCRIPTION
Presentation about term paper on the 1 year of study.TRANSCRIPT
![Page 1: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/1.jpg)
Fulfilled by: Zadorin DmitryGroup 372 SE
Scientific adviser: Avdoshin S.M
Subject: Finite state automata minimization
![Page 2: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/2.jpg)
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
![Page 3: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/3.jpg)
State transition table State diagram
12.04.23
![Page 4: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/4.jpg)
Minimization creates automat that is similar to the original one
But this new automaton has less states
12.04.23
![Page 5: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/5.jpg)
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
![Page 6: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/6.jpg)
Automate minimization techniqueUnderstanding minimization processExplain the basis of automata
![Page 7: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/7.jpg)
Program is written on the csharp (C#) programming language
Program requires .Net 2.0 or higher installed
12.04.23
![Page 8: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/8.jpg)
12.04.23
![Page 9: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/9.jpg)
12.04.23
![Page 10: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/10.jpg)
12.04.23
![Page 11: Finite state automaton](https://reader035.vdocuments.mx/reader035/viewer/2022062307/55504797b4c90580748b4ebe/html5/thumbnails/11.jpg)
12.04.23