Scribd
Upload
54 views4 pages

Cs331: Theory of Computation: July 29, 2003

The document provides examples of languages that can and cannot be recognized by deterministic finite automata (DFAs). Example 1 defines language L1 that is recognizable by a DFA using 6 states. Example 2 defines language L2 containing strings of 0s and 1s of equal length that cannot be recognized by any finite automaton. Example 3 defines language L3 of strings of 0s that also cannot be recognized by a DFA, as the information needed grows arbitrarily large. The document then introduces non-deterministic finite automata (NFAs), which can recognize languages not recognizable by DFAs by allowing transitions to multiple possible states.

Uploaded by

Vicky Mit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
54 views4 pages

Cs331: Theory of Computation: July 29, 2003

The document provides examples of languages that can and cannot be recognized by deterministic finite automata (DFAs). Example 1 defines language L1 that is recognizable by a DFA using 6 states. Example 2 defines language L2 containing strings of 0s and 1s of equal length that cannot be recognized by any finite automaton. Example 3 defines language L3 of strings of 0s that also cannot be recognized by a DFA, as the information needed grows arbitrarily large. The document then introduces non-deterministic finite automata (NFAs), which can recognize languages not recognizable by DFAs by allowing transitions to multiple possible states.

Uploaded by

Vicky Mit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 4

CS331 : THEORY OF COMPUTATION

Lecture 4
July 29, 2003

EXAMPLES
Example 1: Let us dene a Language L1 = {0} L1 = {0n |n = 6k, k 1}

Figure 1: Transition Diagram for DFA recognizing language L1

In this model while reading the input string the information required to check the validity of string is nite. Precisely we have to remember 6 states. Intermixing of any two of them may lead to incorrect recognition. In this language there are nite number of states and thus nite amount of information stored in them. Example 2: Let us dene a Language L2 = {0, 1} L2 = {0n 1n |n 1} To check acceptance of strings of this language, we have to remember number of 0s which can be arbitrarily large. So we cannot express this language with any Finite Automaton. Example 3: Let us dene a language L3 such as = {0} L3 = {0n |n 1} 1
2

Here though the situation is not like L2 , but the dierence between the length of strings to be accepted keeps on increasing. So, the information to be remembered becomes arbitrarily large. Due to that, we cannot recognize this language using nite amount of information. We are sure that this language cannot be recognized by DFA.

NON-DETERMINISTIC FINITE AUTOMATION (NFA)

As we know that in DFA Q : f inite set of states : alphabet s0 Q : starting state F Q : set of accepting states Transition Function in DFA is dened as :QQ

1.1

Dierence between DFA and NFA

In DFA the transition function gives exactly one state, when applied from some state on an input symbol. In the nondeterministic automaton there can be several possible next states , and the automaton guesses (always correctly) which next state (of the set of possible next states) will lead to acceptance of the input string. DFA is a particular case of NFA. So, transition function in NFA is : Q 2Q Here the Transition Function will give set of states : alphabet Q : f inite set of states : Q 2Q Here NFA has four states : A,B,C and D

Figure 2: Transition Diagram of an NFA : N1

Figure 3: Possible transitions in N1 on seeing the input aba

1.2

Acceptance condition of NFA


(s0 , w) F

In DFA the acceptance condition is It means that on applying string w to the automata with s0 as the starting state, we should end up in a nal(accepting) state. But in NFA the acceptance condition is dened as: (s0 , w) F =

An input sequence is accepted by a NFA if there exists a sequence of transitions, corresponding to the input sequence , that leads from the initial state to some nal state. : Q 2Q : Q 2Q Here is set of strings (q, ) = {q}; q Q (q, xa) = ((q, x), a) =
p(q,x)

(p.a)

Applying to our example in g3 (A, ) = {A}

(A, a) = (A, a) = {B, C, D} (A, ab) =


p{B,C,D}

(p, b) = (B, b) (C, b) (D, b)

= {A, B} {B} = {A, B} (A, aba) =


(A,ab)

(p, a) =
p{A,B}

(p, a)

= (A, a) (B, a) = {B, C, D} = {B, C, D}

You might also like