Lecture 05: Theory of Automata:2011

Finite Automata

DFA

UIIT, PMAS-Arid Agriculture University, Rawalpindi

Lecture 05: Theory of Automata:2011

Finite Automata

• Yet Another Method for Defining Languages

• FAs and Their Languages

2
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Definition
• Consider the Language L , defined over Σ = {a, b} of all
non empty strings.

3
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

EVEN-EVEN
Consider the EVEN-EVEN language, defined over Σ = {a,
b}.

4
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Note
Consider the Language L , defined over Σ = {a, b} of all strings
including Λ

The language L may also be accepted by the following TG

5
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Equivalent FA

It is to be noted that two FAs are said to be equivalent, if

they accept the same language

6
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Transition Diagrams
• Consider the language L of strings, defined over Σ={a, b}, ending in a

There may be another FA corresponding to the given language,

7
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Note !
• Consider the following FA, defined over Σ = {a, b}

It is to be noted that the above FA does not accept any string, even it
does not accept the null string; as there is no path starting from initial
state and ending in final state.

8
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Consider a FA that accepts exactly ‘a’

9
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw FA that accepts all words starting with a.

10
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw a DFA that accepts only a or b Σ = {a, b}

11
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw a DFA for a language that has second letter as b

over Σ={a, b},

12
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw a DFA for a language in which each word

has exactly one a over Σ={a, b},

13
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw a FA that accepts all string with double aa

14
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

• Draw a DFA that accepts all words starting and

ending with ‘a’ over Σ = {a, b}

15
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

16
UIIT, PMAS-Arid Agriculture University, Rawalpindi
Lecture 05: Theory of Automata:2011

Transition Table
• The transition list can be summarized in a table
format in which each row is the name of one of
the states, and each column is a letter of the
input alphabet.
• For example, the transition table for the FA
above is

17
UIIT, PMAS-Arid Agriculture University, Rawalpindi