Scribd
Upload
63 views

2nd Class

The document discusses finite automata and nondeterminism. It defines a finite automaton as a machine that can be in a given state and transition to another state based on an input symbol. A nondeterministic finite automaton (NFA) allows for multiple possible next states from a given state on a single input, while a deterministic finite automaton (DFA) always has exactly one next state. The document provides an example of designing a finite automaton to accept strings with an even number of 1s, and notes that any language accepted by an NFA can also be accepted by an equivalent DFA.

Uploaded by

amukhopadhyay
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
63 views

2nd Class

The document discusses finite automata and nondeterminism. It defines a finite automaton as a machine that can be in a given state and transition to another state based on an input symbol. A nondeterministic finite automaton (NFA) allows for multiple possible next states from a given state on a single input, while a deterministic finite automaton (DFA) always has exactly one next state. The document provides an example of designing a finite automaton to accept strings with an even number of 1s, and notes that any language accepted by an NFA can also be accepted by an equivalent DFA.

Uploaded by

amukhopadhyay
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Finite Automata

AM
26.1.15

Designing Finite
Automata
Designing is a crucial part of
automaton theory

Example
Design a finite automata what will
accept only the strings consist of
even number of 1s, where input set
is: {0,1}

NONDETERMINISM
When a m/c is in given state and
read next i/p symbol, we know what
will be the next state- called
Deterministic system
In a nondeterministic m/c several
choices may exist for the next state
at any point.

Difference between DFA


and NDFA
DFA

NDFA

Every state of DFA has exactly


one existing transition for each
symbol in the alphabet

In an NFA a state may have 0, 1


or many existing arrows for each
alphabet symbol

In DFA labels on the transition


arrows are symbols from the
alphabets

NFA may have arrows labeled


with members of the alphabet or
special symbol

Formal Definition of NFA

Define all tuple in the following


diagram

Equivalency between
DFA and NFA
Theorem 1: For every NDFA, there exists a DFA which simulates
the behaviour of NDFA. Alternatively, if L is the set accepted by
NDFA, then there exists a DFA which also accepts L.

The above theorem will be demonstrated in the class.

You might also like