Scribd Logo
Upload

Welcome to Scribd!

  • Automata Theory: José Anastacio Hernández Saldaña

    Uploaded by

    Milton Alfonso Gomez Gonzalez
    74 views4 pages
    This document outlines the course details for an Automata Theory class. It lists the instructor, José Anastacio Hernández Saldaña, and class duration from January 2020 to May 2020. It identifies topics that will be covered including formal logic, alphabets and languages, regular languages, deterministic and non-deterministic finite automata, free context languages, pushdown automata, Turing machines, Chomsky hierarchy, and computational complexity. Assignments are identified including homework problems, midterm exam, and final exam.

    Original Description:

    Original Title

    Automatas

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the course details for an Automata Theory class. It lists the instructor, José Anastacio Hernández Saldaña, and class duration from January 2020 to May 2020. It identifies topics that will be covered including formal logic, alphabets and languages, regular languages, deterministic and non-deterministic finite automata, free context languages, pushdown automata, Turing machines, Chomsky hierarchy, and computational complexity. Assignments are identified including homework problems, midterm exam, and final exam.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    74 views4 pages

    Automata Theory: José Anastacio Hernández Saldaña

    Uploaded by

    Milton Alfonso Gomez Gonzalez
    This document outlines the course details for an Automata Theory class. It lists the instructor, José Anastacio Hernández Saldaña, and class duration from January 2020 to May 2020. It identifies topics that will be covered including formal logic, alphabets and languages, regular languages, deterministic and non-deterministic finite automata, free context languages, pushdown automata, Turing machines, Chomsky hierarchy, and computational complexity. Assignments are identified including homework problems, midterm exam, and final exam.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 4

    Automata Theory

    José Anastacio Hernández Saldaña

    <2020-01-18 Sat>

    Contents
    1 INFO 1
    1.1 Instructor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
    1.2 Class Duration . . . . . . . . . . . . . . . . . . . . . . . . . . 1
    1.2.1 Holidays . . . . . . . . . . . . . . . . . . . . . . . . . . 2

    2 Themes 2
    2.1 Formal Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
    2.2 Alphabets and languages . . . . . . . . . . . . . . . . . . . . . 2
    2.3 Regular languages . . . . . . . . . . . . . . . . . . . . . . . . 2
    2.4 Deterministic Finite Automata . . . . . . . . . . . . . . . . . 2
    2.5 Non-Deterministic Finite Automate . . . . . . . . . . . . . . . 3
    2.6 Free Context Languages . . . . . . . . . . . . . . . . . . . . . 3
    2.7 Pushdown automata . . . . . . . . . . . . . . . . . . . . . . . 3
    2.8 Chomsky Hierarchy . . . . . . . . . . . . . . . . . . . . . . . . 3
    2.9 Turing Machine . . . . . . . . . . . . . . . . . . . . . . . . . . 3
    2.10 Computational Complexity . . . . . . . . . . . . . . . . . . . 3

    3 Score 3

    1 INFO
    1.1 Instructor
    José Anastacio Hernández Saldaña, M.C.

    1.2 Class Duration


    <2020-01-20 Mon>–<2020-05-16 Sat>

    1
    1.2.1 Holidays
    1. Constitution day:: <2020-02-03 Mon>
    2. Benito Juarez/Spring:: <2020-03-16 Mon>
    3. Eastern vacations:: <2020-04-06 Mon>–<2020-04-19 Sun>
    4. Labour day:: <2020-05-01 Fri>
    5. Puebla’s battle:: <2020-05-05 Tue>
    6. Teacher’s day:: <2020-05-15 Fri>

    2 Themes
    2.1 Formal Logic
    • Morgan Laws
    • Excercise 0.1 odds
    • Excercise 0.3 4,6,9
    • Excercise 0.4 1,5,13,
    • Excercise 0.5 1,2
    • Excercise 0.6 1,2,6

    2.2 Alphabets and languages


    • Problems 1.3 4,5,6

    2.3 Regular languages


    • Excercise 2.1 all
    • Theorem 2.2
    • Excercise 2.2 all

    2.4 Deterministic Finite Automata


    • Excercise 2.3 all
    • Excercise 2.4 all

    2
    2.5 Non-Deterministic Finite Automate
    • Excercise 2.5 all

    • Excercise 2.6 all

    • Excercise 2.8 even

    • Excercise 2.9 odds

    2.6 Free Context Languages


    • Excercise 3.1 all

    • Excercise 3.2 even

    • Excercise 3.3 all

    • Excercise 3.5 odds

    • Excercise 3.6 1,2,3,4

    2.7 Pushdown automata


    • Excercise 3.7 all except 3.7.7

    • Excercise 3.8 odds

    2.8 Turing Machine


    • Excercise 4.1 all

    • Excercise 4.2 even

    • Excercise 4.3 even

    • Excercise 4.4 odds

    • Excercise 4.5 all

    2.9 Chomsky Hierarchy


    • Draw chomsky hierarchy diagram

    3
    2.10 Computational Complexity

    3 Score
    • Homework problems part 1 20 pts <2020-03-13 Fri>

    • Mid term exam 25 pts <2020-03-18 Wed>

    • Homework problems part 2 20 pts <2020-05-08 Fri>

    • Final exam 25 pts <2020-05-13 Wed>

    • PIA 20 pts

    You might also like