Scribd
Upload
174 views

Á An NFA Is A TG With A Unique Start

An NFA is a type of finite automaton that extends a deterministic finite automaton by allowing transitions under a single input symbol to multiple states from a given state. This document provides examples of NFAs and their languages, and discusses how to convert an NFA to an equivalent finite automaton. It also describes how NFAs with an empty string transition can accept languages containing the empty string and how the structure of an NFA relates to its corresponding regular expression.

Uploaded by

tariqravian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
174 views

Á An NFA Is A TG With A Unique Start

An NFA is a type of finite automaton that extends a deterministic finite automaton by allowing transitions under a single input symbol to multiple states from a given state. This document provides examples of NFAs and their languages, and discusses how to convert an NFA to an equivalent finite automaton. It also describes how NFAs with an empty string transition can accept languages containing the empty string and how the structure of an NFA relates to its corresponding regular expression.

Uploaded by

tariqravian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 23

| 



  

| 
á  An NFA is a TG with a unique start
state and a property of having single letter as
label of transitions. An NFA is a collection of
three things
1) Finite many states with one initial and some
final states
2) Finite set of input letters, say, ë={a, b, c}
3) Finite set of transitions, showing where to
move if a letter is input at certain state ( is
not a valid transition), there may be more than
one transition for certain letters and there may
not be any transition for certain letters.
u  

Œt may be observed, from the definition of NFA,


that the string is supposed to be accepted, if there
exists at least one successful path, otherwise
rejected.
Œt is to be noted that an NFA can be considered to
be an intermediate structure between FA and TG.
The examples of NFAs can be found in the
following
Ñ 

2+
a

1è a
3

a
b
4 5+

Œt is to be noted that the above NFA accepts


the language consisting of a and ab.
Ñ 

a, b a,b

a a
1è 2 3+

Œt is to be noted that the above NFA accepts


the language of strings, defined over
Ȉ = {a, b}, containing aa.
[ 





 
|
r Œt is to be noted that according to the Kleene¶s
theorem, if a language can be accepted by an FA,
then there exists a TG accepting that language.
Since, an NFA is a TG as well, therefore there
exists an NFA accepting the language accepted
by the given FA. Œn this case these FA and NFA
are said to be equivalent to each others.
Following are the examples of FAs to be
converted to the equivalent NFAs
Ñ 

r onsider the following FA corresponding to


(a+b)*b a b
b
è +
a

r The above FA may be equivalent to the following


NFA a, b
- b
+
an the structure of above NFA be compared
with the corresponding RE ?
Ñ 

r onsider the following FA


b a,b
a
a
è 1 +
b

r The above FA may be equivalent to the


following NFA a, b a,b
a a
è 1 +

r an the structure of above NFA be compared


with the corresponding RE ?
{

 

|
 


  

a
2 4

a a
b a,b

 a b 

b a b

3 b 5
  


|

r There is an important application of an NFA


in artificial intelligence, which is discussed in
the following example of a maze
è 1 2 3
4 L 5 O
6 M 7 P
8 N 9
Ñ 
[  


- and + indicate the initial and final states


respectively. One can move only from a box
labeled by other then L, M, N, O, P to such
another box. To determine the number of ways
in which one can start from the initial state and
end in the final state, the following NFA using
only single letter a, can help in this regard
Ñ 
 

a a a

è 1 2 3
a a
a a a
a a

4 5

a a a a
a a a

6 8 7 9 +
a a a
Ñ 
 


r Œt can be observed that the shortest path which


leads from the initial state and ends in the final
state, consists of six steps à  the shortest string
accepted by this machine is aaaaaa. The next
larger accepted string aaaaaaaa.Thus if this NFA
is considered to be a TG then the corresponding
regular expression may be written as
aaaaaa(aa)*
Which shows that there are infinite many
required ways
| 

 



 










|








 
 
 



 


|







{







 
 







 


 



 






|





 




  
{
  





  
|

| 

á  Œf in an NFA, is allowed to be a
label of an edge then the NFA is called NFA
with (NFA- ).
An NFA- is a collection of three things
2  Finite many states with one initial and some
final states. 2 Finite set of input letters, say,
ë={a, b, c}. 2 Finite set of transitions, showing
where to move if a letter is input at certain state.
There may be more than one transitions for certain
letter and there may not be any transition for a
certain letter. The transition of is also allowed
at any state.
Ñ 

onsider the following NFA with Null string


a, b

- b +
1

The above NFA with Null string accepts the


language of strings, defined over Ȉ = {a, b},
 
.
Ñ 

onsider the following NFA with Null string


a, b

,a a
è 1 +

The above NFA with Null string accepts the


language of strings, defined over Ȉ = {a, b},
  .
| 

r Œt is to be noted that every FA may be


considered to be an NFA- as well, but the
converse may not true.

r Similarly every NFA- may be considered to


be a TG as well, but the converse may not
true.
|  
Two methods are discussed in this regard.
´   : Since an NFA can be considered to
be a TG as well, so a RE corresponding to the
given NFA can be determined (using Kleene¶s
theorem). Again using the methods discussed
in the proof of Kleene¶s theorem, an FA can be
built corresponding to that RE. Hence for a
given NFA, an FA can be built equivalent to
the NFA. Examples have, indirectly, been
discussed earlier.
|  

´   : Since in an NFA, there more than one
transition for a certain letter and there may not
be any transition for certain letter, so starting
from the initial state corresponding to the
initial state of given NFA, the transition
diagram of the corresponding FA, can be built
introducing an empty state for a letter having
no transition at certain state and a state
corresponding to the combination of states, for
a letter having more than one transitions.
Following are the examples
Ñ 
onsider the following NFA
2
a b

1- 4

b a
3
Using the method discussed earlier, the above
NFA may be equivalent to the following FA
Ñ 
[  

2
a b

1- 4+
b a

3 1- a
2
b

b 4+ a
a a, b

3 b
ë a, b
Ñ 

r A simple NFA that accepts the language of


strings defined over ë={a,b}, a   



b b b
1- 2 3 4+

r The above NFA can be converted to the


following FA
Ñ 
[  

b

b b b
1- 2 3 4+

b b b
1- 2 (3,4)+ 4+

a a a a,b

ë
a, b

You might also like