Академический Документы
Профессиональный Документы
Культура Документы
Personal Introduction
Introduction
Theory o f Automata
Educational Background
[2011] PhD (Information Technology) from Malaysia [2006] MS (Digital Media) from Germany [2001] MSc (Computer Science) from MAJU
Working Experience
[2008] Assistant Professor at Bahria University [2007] Visiting Lecturer at Bahria University [2006] Assistant Professor at RIU [2005] Research work for 3D models optimization in Germany [2002] Principal at ICMS [2001] Lecturer at AIOU and PIMSAT
Normal form grammars and parsing, Push-down Automata, Pumping lemma and non-context free languages, Decidability, Chomskys hierarchy of grammars Turing Machines Theory: Turing machines, Post machine, Variations on TM, TM encoding, Universal Turing Machine Context sensitive Grammars, Defining Computers by TMs.
Recommended Books
Introduction to Computer Theory, Denial Cohen, John Wiley & Sons, Inc. Theory of Automata By C.J. Martin Introduction to Automata Theory, Languages & Computation, J Hopcraft, D. Ullman Languages & Machines, An Into to the Theory of Computer Science, 2/e Thomas A. Sudkamp, Addison Wesley.
2/15/2012
Example: f ( x) = x
temporary memory temporary memory input input CPU output Program memory Program memory compute compute CPU output
xx x2 x
f ( x) = x
temporary memory input
temporary memory
z = 2*2 = 4 f ( x) = z * 2 = 8
f ( x) = x3
input
x=2
CPU output Program memory compute compute Program memory CPU
x=2
output compute compute
xx
xx x2 x
x2 x
temporary memory
z = 2*2 = 4 f ( x) = z * 2 = 8
f ( x) = x3
Automaton
temporary memory
input
x=2
CPU
f ( x) = 8
Program memory compute compute
xx x x
2
output
2/15/2012
Automaton
temporary memory Automaton input
output
transition
Turing Machines:
state
Finite Automaton
temporary memory
Pushdown Automaton
Temp. memory
Stack
Push, Pop
Finite Automaton
input
Pushdown Automaton
input
Turing Machine
Temp. memory
Power of Automata
Simple problems More complex problems Hardest problems
Turing Machine
Finite Automata
Pushdown Automata
Turing Machine
output Less power Examples: Any Algorithm (highest computing power) More power Solve more computational problems
2/15/2012
Language
Letters, Words, Sentences Alphabets join to form words Words combine to form sentences Sentences combine to form paragraphs and so on
Languages
How can we tell whether a given sentence belongs to a particular language
Black is cat the The water is cold I like chocolates two much
Informal Languages
Natural languages are generally defined informally Human brains are capable to understand incoherent even invalid sentences
We school daily go to
Informal Languages
Incoherent strings are also understandable
Slang, idiom, dialect etc.
Raises ambiguity
Interpretation varies with region Same words have multiple meanings
Like, light, base etc.
Summary of Languages
Three aspects/specifications
Lexical
Defines valid words/units of a language
Syntactic
Defines rules for combining the units to form valid sentences (computer programs in context of machines)
Semantic
Concerned with the interpretation or meaning of a sentence (what output to produce in context of machines) Affected by ambiguity the most