Finite automaton, Study notes for Introduction to Computing. Aston University
izadt_arfa
izadt_arfa12 July 2015

Finite automaton, Study notes for Introduction to Computing. Aston University

PPTX (77 KB)
4 pages
1000+Number of visits
Description
DFA
20 points
Download points needed to download
this document
Download the document
Preview3 pages / 4

This is only a preview

3 shown on 4 pages

Download the document

This is only a preview

3 shown on 4 pages

Download the document

This is only a preview

3 shown on 4 pages

Download the document

This is only a preview

3 shown on 4 pages

Download the document

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

comments (0)

no comments were posted

be the one to write the first!

This is only a preview

3 shown on 4 pages

Download the document