For each Finite Deterministic Automaton apply the minimization of FDA and its definitions (set of states, language, initial state, final state and transition table).

1. Get a deterministic finite automaton to define function prototypes in the programming language of your choice.

Get a deterministic finite automaton for the language that includes only all strings that do not have a consecutive pair of zeros.

Get a deterministic finite automaton for the language of all strings starting with the letter a repeated at least 4 times and then the maximum repeated letter b 3 times.

Get a deterministic finite automaton that indicates the set of all strings formed by symbols 1 and 2, happening any number of times (in any order), and always ending the string in 3.

Get a deterministic finite automaton given the following language defined in the alphabet = {0,1}. The set of strings starting at "0".