Automata Theory

José Anastacio Hernández Saldaña

<2022-08-09 Tue>

Contents
1 INFO 1
1.1 Instructor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Class Duration . . . . . . . . . . . . . . . . . . . . . . . . . . 2
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 Turing Machine . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.9 Chomsky Hierarchy . . . . . . . . . . . . . . . . . . . . . . . . 3
2.10 Introduction to Computational Complexity . . . . . . . . . . 3

3 Book 4

4 Score 4

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

1
1.2 Class Duration
<2022-08-08 Mon>–<2022-11-12 Sat>

1.2.1 Holidays
• Mexican Independence: <2022-09-16 Fri>

• Mexican Revolution: <2022-11-21 Mon>

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.2

• Excercise 2.2 all

2.4 Deterministic Finite Automata

• Excercise 2.3 all

• Excercise 2.4 1,2

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 except 3.1.5 c
• Excercise 3.2 even
• Excercise 3.3 all
• Excercise 3.5 odds
• Excercise 3.6 1,2

2.7 Pushdown automata

• Excercise 3.7 all except 3.7.7
• Excercise 3.8 odds except 3.8.5

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

2.10 Introduction to Computational Complexity

• Draw complexity hierarchy classes

3
3 Book
Teoría de autómatas y lenguajes formales. Dean Keally.

4 Score
• Homework problems part 1 10 pts <2022-09-08 Thu>

• PIA 1 10 pts <2022-09-13 Tue>

• Exam 1 20 pts <2022-09-15 Thu>

• Homework problems part 2 10 pts <2022-10-06 Thu>

• Exam 2 20 pts <2022-10-11 Tue>

• Homework problems part 3 10 pts <2022-10-13 Thu>

• PIA 2 10 pts <2022-11-03 Thu>

• Exam 3 20 pts <2022-11-08 Tue>

• Total 110 pts NO additional extra points

Tema Puntos
Homework problems part 1 10
Exam 1 20
PIA 1 10
Homework problems part 2 10
Exam 2 20
Homework problems part 3 10
Exam 3 20
PIA 2 10
Total 110
ˆ x