Course Content Worksheet EEC/IQAC/Academic/Form1.1.
09-R00
EXCEL ENGINEERING COLLEGE
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
Department of Artificial Intelligence and Data Science
Worksheet
Course Code: 20AI403 Course Name: Formal Language and Automata Theory
Sem/Year: IV / II Lecture Hour:1 Date:
Unit / Session Title: Unit 1 – Automata Fundamentals: Introduction to formal proof
Course Objective: Perceive Automata theory and the language hierarchy
i. Ability to learn the proof
Specific Objectives ii. To know what practical results can be gained from a suitable
mathematical theory
Outcome: Solve real world problem in computer field
Teaching Aid: Black board/PPT/Video/Demo Model/Lab/Out Bound
1) Statement / Theorem / Concept
2)Block Diagram/Circuit Diagram/Flowchart/Algorithm
Notes: 3)Construction/Explanation/Derivation /
Advantages/Disadvantages/Application
4)Exercise Equation / Answer
16 Marks / 8 Marks / 4 Marks / 2 Marks / 1 Mark
1) 16 Mark
Possible Questions: 2) 8 Marks
3) 2 Marks
4) 1 Mark – Objective Type
Question – answer
Quiz / MCQ’s
Slip Test
Evaluation Method: Reading
Seminar
Assignment
Open Book Test
Each concept must be introduced through industrial application
Text book followed : Hopcroft J.E, Motwani and Ullman.D, “Introduction to Automata Theory,
Languages and Computations”, Pearson Education, 3rd Edition 2017
Reference book followed : Micheal Sipser, “Introduction of the Theory and Computation”, Thomson
Learning, 3rd Edition 2018.
Website referred :https:/ /nptel.ac.in/courses/106/103/106103070/
Faculty Incharge HoD Director-Academic
Course Content Worksheet EEC/IQAC/Academic/Form1.1.09-R00
EXCEL ENGINEERING COLLEGE
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
Course Code: 20CS401 Course Name: Formal Language and Automata Theory
Formal Proofs
• When we study automata theory, we encounter theorems that we have to prove.
• There are different forms of proofs:
– Deductive Proofs
– Inductive Proofs
– Proof by Contradiction
– Proof by a counter example (disproof)
• To create a proof may NOT be so easy.
• A deductive proof consists of a sequence of statement whose truth leads us from some
initial statement (hypothesis or given statements) to a conclusion statement.
• Each step of a deductive proof MUST follow from a given fact or previous statements (or their
combinations) by an accepted logical principle.
• The theorem that is proved when we go from a hypothesis H to a conclusion C is the
statement ’’if H then C’’. We say that C is deduced from H.
• Assume that the following theorem (initial statement) is given:
– Given Thm. (initial statement): If x ≥ 4, then 2 x ≥ x2
– We are not going to prove this theorem, we assume that it is true.
• If we want we can prove this theorem using proof by induction.
• Theorem to be proved:
If x is the sum of the squares of four positive integers, then 2 x ≥ x2
Course Content Worksheet EEC/IQAC/Academic/Form1.1.09-R00
EXCEL ENGINEERING COLLEGE
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
Example: Proof of a Theorem
If x is the sum of the squares of four positive integers, then 2 x ≥ x2
Statement Justification
1. If x ≥ 4, then 2x ≥ x2 Given theorem
2. x = a2 + b2 + c2 + d2 Given
3. a ≥ 1 b≥1 c≥1 d≥1 Given
4. a2 ≥ 1 b2 ≥ 1 c2 ≥ 1 d2 ≥ 1 From (3) and principle of arithmetic
5. x ≥ 4 From (2), (4) and principle of arithmetic
6. 2x ≥ x2 From (1) and (5)
If-And-Only-If Statements
• Some times theorems contain if-and-only-if statements.
– A if and only if B
– A iff B
– A is equivalent to B
• In this case we have to prove in both directions. In order to prove A if and only if B,
we have to prove the following two statements:
1. If-Part: if B then A
2. Only-If-Part: if A then B
A Sample iff Theorem:
Let x be a real number. Then ëxû = éxù if and only if x is an integer.
Remember: ëxû is the floor of real number x is the greatest integer equal to or less than x
éxù is the ceiling of real number x is the least integer equal to or greater than x
Proof of an iff Theorem
Course Content Worksheet EEC/IQAC/Academic/Form1.1.09-R00
EXCEL ENGINEERING COLLEGE
(Autonomous)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Accredited by NBA, NAAC with “A+” and Recognised by UGC (2f &12B)
KOMARAPALAYAM - 637303
Let x be a real number. Then ëxû = éxù if and only if x is an integer.
If-Part:
• Given that x is an integer.
• By definitions of ceiling and floor operations. ëxû = x
• Thus, ëxû = éxù .
Only-If-Part:
• Given that ëxû = éxù
• By definitions of ceiling and floor operations. ëxû ≤ x and éxù ≥ x
• Since given that ëxû = éxù, éxù ≤ x and éxù ≥ x
• By the properties of arithmetic inequalities, éxù = x
• Since éxù is always an integer, x MUST be integer too. ð
Possible Questions:
1. Define computation and theory of computation.
2. Define deductive proof
3. Define proof by contrapositive
4. If x is the sum of the squares of four positive integers, then 2 x ≥ x2
5.
