Scribd
Upload
9 views17 pages

Lec2.1_DFA

This document discusses Deterministic Finite Automata (DFA) as part of a lecture on Regular Languages. It outlines the formal specification of a finite automaton, including its components such as states, input symbols, initial state, final states, and transition function. An example is provided, illustrating a DFA that accepts all strings ending with 0.

Uploaded by

ayman mossad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views17 pages

Lec2.1_DFA

This document discusses Deterministic Finite Automata (DFA) as part of a lecture on Regular Languages. It outlines the formal specification of a finite automaton, including its components such as states, input symbols, initial state, final states, and transition function. An example is provided, illustrating a DFA that accepts all strings ending with 0.

Uploaded by

ayman mossad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Lecture 2

Regular Languages
(Deterministic Finite Automata (DFA))

Dr. Mohammed AbdelFattah


Finite Automata
A Finite Automata consists of the following :
Formal specification of machine is
{ Q, ∑, q, F, δ }.
• Q : Finite set of states.
• ∑ : set of Input Symbols.
• q0 : Initial state.
• F : set of Final States.
• δ : Transition Function.
more
Finite Automata
• FA is characterized into two types:

1. Deterministic Finite Automata (DFA)


2. Nondeterministic Finite Automata(NFA)
1) Deterministic Finite Automata (DFA)

• For a particular input character


• The machine goes to one state only.
• A transition function is defined on every state for
every input symbol.
• Null (or ε) move is not allowed, i.e., DFA cannot
change state without any input character.
There can be many possible DFAs for a pattern. A
DFA with minimum number of states is generally
preferred.
Deterministic Finite Automata (DFA)
• Example
• DFA with ∑ = {0, 1} accepts all strings ending
with 0.
END

You might also like