Preview3 pages / 4

## Search in the document preview

**Finite Automaton
Deterministic Finite Automata
**

**(DFA)
Simulation of DFA
**

Muhammad Shah Fitri Amran (4131006831) Mohamad Syazani Baharuddin (4131001661)

Introduction A simple machine model called

deterministic finite automata that to recognize exactly the class of regular language.

A simple machine which reads an input string one letter at a time and then, after the input is completely read, decides to accept or to reject the input.

A can be represented as a quintuple or 5 tuple M=(Q, Ʃ, δ, q₀, F)

Q : SETS OF STATES Ʃ : INPUT ALPHABET δ : TRANSITION FUNCTION q₀ : INITIAL STATE F : SET OF ACCEPTING STATES

no comments were posted