Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    01 Introduction To Automata

    Uploaded by

    shyamd4
    This document provides an introduction to the course "Automata, Languages and Computation". It discusses formal languages and how they are formed based on mathematical principles and grammar rules. It defines automata theory as the study of abstract computing devices and models of computation, including finite automata, pushdown automata, and Turing machines. A brief history of automata theory is given alongside the key contributors to the field. The document lists two recommended textbooks and outlines the main outcomes of the course, which include designing various models of computation and applying concepts like pumping lemmas.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    01 Introduction To Automata

    Uploaded by

    shyamd4
    23 views8 pages
    This document provides an introduction to the course "Automata, Languages and Computation". It discusses formal languages and how they are formed based on mathematical principles and grammar rules. It defines automata theory as the study of abstract computing devices and models of computation, including finite automata, pushdown automata, and Turing machines. A brief history of automata theory is given alongside the key contributors to the field. The document lists two recommended textbooks and outlines the main outcomes of the course, which include designing various models of computation and applying concepts like pumping lemmas.

    Original Title

    01 Introduction to automata

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an introduction to the course "Automata, Languages and Computation". It discusses formal languages and how they are formed based on mathematical principles and grammar rules. It defines automata theory as the study of abstract computing devices and models of computation, including finite automata, pushdown automata, and Turing machines. A brief history of automata theory is given alongside the key contributors to the field. The document lists two recommended textbooks and outlines the main outcomes of the course, which include designing various models of computation and applying concepts like pumping lemmas.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    23 views8 pages

    01 Introduction To Automata

    Uploaded by

    shyamd4
    This document provides an introduction to the course "Automata, Languages and Computation". It discusses formal languages and how they are formed based on mathematical principles and grammar rules. It defines automata theory as the study of abstract computing devices and models of computation, including finite automata, pushdown automata, and Turing machines. A brief history of automata theory is given alongside the key contributors to the field. The document lists two recommended textbooks and outlines the main outcomes of the course, which include designing various models of computation and applying concepts like pumping lemmas.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 8

    Automata, Languages and Computation

    Dr. K Shyam Sunder Reddy


    Associate Professor
    Department of Computer Science & Engineering
    Maturi Venkta Subba Rao (MVSR) Engineering College
    shyam_cse@mvsrec.edu.in
    Introduction
    Formal Language
    • Meta language to describe the formal or official description of a language.
    • A formal language consists of words whose letters are taken from an alphabet and are
    well-formed according to a specific set of rules.
    • A language which is formed based on mathematical principles / Grammar rules.
    • Every programming language is a Formal Language.
    • Every language will have its grammar rules.
    Introduction (contd.)
    What is Automata Theory?
    • Automata →plural of the word ‘ automaton’ which means to automate or mechanize.
    • Automaton = an abstract computing device
    • Study of abstract computing devices, or machines.
    • Abstract devices are (simplified) models of real computations
    • It deals with the definitions and properties of mathematical models of computation.
    • One model, called Finite Automaton, is used in Text Processing, Compilers, and
    Hardware design.
    • Another model, called Grammar, is used in Programming languages and Artificial
    Intelligence.
    Introduction (contd.)
    Automata Theory: A Historical Perspective
    When? Who? What?
    1930s Alan Turing •Turing machines
    • Computability Theory

    1940-1950s Post, Church, • Simpler Machines


    Kleene, etc., (FA, PDA, Post Machine)
    Introduction (contd.)
    Automata Theory: A Historical Perspective
    When? Who? What?

    1950s N. Chomsky “Chomsky Hierarchy” for formal


    languages

    1969 Stephen Cook “Complexity Theory”


    Theory Automata
    - Aim: to study Mathematical models (Abstract machines) of computation.

    Models of Computation

    Machine-like Language-like
    Finite Automata (Devices with a finite amount of memory. Regular Expressions
    Used to model “small” computers.) (Algebraic representation
    of a language)
    Pushdown Automata (Devices with infinite memory that can Context-free Grammar
    be accessed in a restricted way. Used to model parsers, etc.) (finite set of rules
    defining a language)
    Turing machine (Devices with infinite memory.
    Used to model any computer.)
    Theory Automata : Text Books
    1. John E.Hopcroft, Rajeev Motwani, 2. Mishra and Chandrashekaran, Theory
    Jeffery D Ulman, Introduction to of Computer Science- Automata
    Automata Theory Languages and languages and computation, Third
    Computation, Third edition, Pearson edition, PHI
    Education.
    Theory Automata
    Course Outcomes
    On completion of the course, you will be able to
    • Design finite automata, RE’s for a given language.
    • Define properties of RL’s, Design grammars, minimize FA and also apply the concept of
    pumping lemma to prove that certain languages are not regular.
    • Design PDA’s for various CFG’s and CFL’s, simplify the CFG’s, define properties of
    CFL’s.
    • Define programming techniques of Turing machines and design Turing machines for
    decidable problems
    • Define and apply the concepts of computability theory.

    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