Scribd
Upload
4 views

lecture 5II

The document provides an overview of finite automata (FA), including their structure, operation, and the languages they can accept. It illustrates the process of reading input strings and determining acceptance or rejection through transition graphs and examples. Additionally, it defines regular languages and highlights that not all languages are regular, with specific examples provided.

Uploaded by

saurabhsingh9305616339
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
4 views

lecture 5II

The document provides an overview of finite automata (FA), including their structure, operation, and the languages they can accept. It illustrates the process of reading input strings and determining acceptance or rejection through transition graphs and examples. Additionally, it defines regular languages and highlights that not all languages are regular, with specific examples provided.

Uploaded by

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

Finite Automata

1
Finite Automaton

Input
String
Output
“Accept”
Finite
or
Automaton
“Reject”

2
Transition Graph
a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

initial accepting
state state
transition
state
3
Initial Configuration
Input String
a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

4
Reading the Input

a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

5
a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

6
a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

7
a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

8
Input finished

a b b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

accept
9
Rejection

a b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

10
a b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

11
a b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

12
a b a

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

13
Input finished

a b a

a, b

reject
q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

14
Another Rejection

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

15

a, b

q5
a, b
b a a b
q0 a q1 b q2 b q3 a q4

reject
16
Another Example

a a b

a a, b

b a, b
q0 q1 q2

17
a a b

a a, b

b a, b
q0 q1 q2

18
a a b

a a, b

b a, b
q0 q1 q2

19
a a b

a a, b

b a, b
q0 q1 q2

20
Input finished

a a b

a a, b
accept

b a, b
q0 q1 q2

21
Rejection Example

b a b

a a, b

b a, b
q0 q1 q2

22
b a b

a a, b

b a, b
q0 q1 q2

23
b a b

a a, b

b a, b
q0 q1 q2

24
b a b

a a, b

b a, b
q0 q1 q2

25
Input finished

b a b

a a, b

b a, b
q0 q1 q2

reject

26
Languages Accepted by FAs
FA M

Definition:
The languageLM  contains
M
all input strings accepted by

LM  M
= { strings that bring
to an accepting state}

27
Example
LM  abba M

a, b

q5
a a, b
b a b
q0 a q1 b q2 b q3 a q4

accept

28
Example
LM   , ab, abba M

a, b

q5
b a a a, b
b
q0 a q1 b q2 b q3 a q4

accept accept accept

29
Example

n
LM  {a b : n 0}

a a, b

b a, b
q0 q1 q2

accept trap state

30
Language Accepted by FAs
For a FA M Q, ,  , q0 , F 

M
Language accepted by :

LM  w  * :  * q0 , w F 

q0 w q q  F

31
Observation
Language rejected byM :

LM  w  * :  * q0 , w F 

q0 w q q  F

32
Example
LM= { all strings with prefix ab }
a, b

q0 a q1 b q2

b a accept

q3 a, b

33
Example
LM = { all strings without
substring 001 }

1 0 0,1
1

 0 1
0 00 001

0
34
Example

L( M ) awa : w  a, b *
a
b
b
q0 a q2 q3

b a
q4

a, b
35
Regular Languages
Definition:
A languageL is regular if there is
FA M such that L LM 

Observation:
All languages accepted by FAs
form the family of regular languages

36
Examples of regular languages:

abba  , ab, abba


awa : w  a, b * {a nb : n 0}
{ all strings with prefix ab }
{ all strings without substring 001 }

There exist automata that accept these


Languages (see previous slides).
37
There exist languages which are not Regular:
n n
Example: L{a b : n 0}

here is no FA that accepts such a language

(we will prove this later in the class)

38

You might also like