Autómata Finito Determinista

Abstract

The following document talks about the use of deterministic finite automaton (which are part of regular languages) which are abstractions of machines, without taking into account either the shape of machinery, not its size but also focuses on understanding how work, capturing only the aspects related to the sequence of events that occur.