Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

Theory of Computation

Computer Science Engineering (CSE) : Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

The document Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev is a part of the Computer Science Engineering (CSE) Course Theory of Computation.
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)

Part I. Introduction to Automata Theory
1 Automation
An automation is defined as a system that performs certain functions without human intervention. It accepts some input as row materials and converts it to a product under the guidance of control signals. An automation can be designed to perform a variety of tasks related to various domain of human life. In terms of computer science, an automation is an abstract model of a digital computer. An automation has some
features.
following figure shows the representation of an automation.
Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

Input
An automation has a mechanism for reading input. It is assumed that input is in a file. The input file is divided into cells. Each cell can hold one symbol. Input mechanism can read input file from left to right.

Output
The automation can produce output of some form.

Storage
An automation can have a temporary storage device. the storage device can consist of unlimited number of cells. The automation can read and change the contents of the storage cells.

Control Unit
Automation has a control unit. At a given time, control unit is in some internal state.

2 Automata Theory
automata theory is the study of abstract computing devices or machines.
The study of automata is important because ,
1. Automata theory plays an important role when we make software for designing and checking the behaviour of a digital circuit.
2. The lexical analysis of a compiler breaks a program into logical units, such as variables, keywords and punctuation using this mechanism.
3. Automata theory works behind software for scanning large bodies of text, such as web pages to find occurrence of words, phrases etc..
4. Automata theory is a key to software for verifying systems of all types (software testing).
5. Automata theory is the most useful concept of software for natural language processing.

Definition of an Automation
an automation is defined as a program where energy, material and information are transformed, transmitted and used for
performing some functions without direct human intervention.
Example: Automatic machine tools,
Automatic packing machines,
Automatic photo copying machines.
Different classes of automata are ,
Finite automata, and
Pushdown automata.
We will learn both of them in detail.

Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!
36 videos|39 docs|39 tests

Up next >

< Previous

Dynamic Test

Content Category

Related Searches

Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

,

ppt

,

Viva Questions

,

Free

,

Sample Paper

,

pdf

,

Semester Notes

,

Previous Year Questions with Solutions

,

Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

,

MCQs

,

video lectures

,

Objective type Questions

,

Extra Questions

,

study material

,

practice quizzes

,

shortcuts and tricks

,

mock tests for examination

,

Summary

,

past year papers

,

Exam

,

Important questions

,

Introduction to Automata Theory Computer Science Engineering (CSE) Notes | EduRev

;