Scribd
Upload
10 views13 pages

UNIT 1 Notes

Unit 1

Uploaded by

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

UNIT 1 Notes

Unit 1

Uploaded by

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

UNIT 1

Introduction to Finite Automata


AUTOMATA
An automaton is a mathematical model of a system with discrete inputs and discrete outputs.
The system is a control unit, which can be any one of a finite number of internal states and
which can change states in some defined manner.

The Fig.shows a general representation of an automaton. The input is a string over a given
alphabet written on an input file; which the automata can read but cannot change. The input
file is divided into set of cells where each cell contains one symbol at a time and also read the
input file left to right one symbol at a time. It also detects the end of the input string by using
specific symbol (i.e. write end marker). The output is also a string of some form. It may have
a temporary storage device, consisting of an unlimited number of cells, each cell containing a
single symbol from an alphabet (cell can contain same or different symbols).
An automaton is used to operate discrete timeframe. At any given time, the system is in some
internal state and the input is scanning a particular symbol on the input file. The internal state
of the system at the next time step is determined by the next state or transition system. This
transition system gives the next state in terms of the current state, the current input symbol and
the information currently in the temporary storage. During the transition from one state to next
state the output may be produced or the information in the temporary storage changed
depending upon the designed machine. The transition from one state to another state is called
move.
Central Concepts Automata
Language :
DETERMINISTIC FINITE AUTOMATON (DFA)

A DFA Can be represented by :


1.Transition Diagram(graph)
2. Transition table.
3. Transition Function
(1) Transition diagram(graph): A transition graph is a finite directed labeled graph in which each
vertex (or node) represents a state and the directed edges indicate the transition of the state
and the edges are labelled with the input alphabet. A transition graph is shown in Fig .

In the Fig the initial state is represented by a ring (or circle) with an arrow pointing towards
it, the final state by two concentric rings (or circles) and the other states are represented by
just a ring (or circle). The edges are labeled by input.
state q0 is an initial state, q2 is a final state and q1 is another state, and the transitions
performed by these states are follows
From state q0 and input 0, go to the next state q1
From state q0 and input 1 go to the next state q0
From state q1 and input 0, go to the next state q1
From state q1 and input 1, go to the next state q2
From state q2 and input 0, go to the next state q2
From state q2 and input 1, go to the next state q2
(2) Transition Table: A DFA may be conveniently represented by a transition table. The transition
table is a tabular representation of a machine. For example, the tabular representation of Fig.
is shown in table 1.
Language of DFA

REFER THE PROBLEMS SOLVED IN CLASS


Non-Deterministic Finite Automata (NFA)
Equivalence of NFA & DFA

PROBLEMS : REFER THE PROBLEMS SOLVED IN CLASS


NFA with ε-transition (ε-NFA)
PROBLEMS : REFER THE PROBLEMS SOLVED IN CLASS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy