LECTURE SERIES TOC

1. Prof.Neeraj Bhargava
Abhishek Kumar
Department of Computer Science
School of Engineering & System Sciences,
MDS, University Ajmer, Rajasthan, India
1

2. Automation
2

3. 3

4. Finite Automata
A finite automaton (FA) is a simple idealized machine
used to recognize patterns within input taken from
some character set (or alphabet) C.
The job of an FA is to accept or reject an input
depending
on whether the pattern defined by the FA occurs in
the input.
4

5.  A transition system or transition graph is a
finite directed labelled graph in which each
vertex represents a state and the directed
edges indicate of a state and the edges
are labelled with input/output.
 These diagrams shows a transition system
and initial and final states.
5

6. 6

7. Thank you
7