Transcription of Introduction to Automata Theory
{{id}} {{{paragraph}}}
1 Introduction to Automata TheoryReading: Chapter 12 What is Automata Theory ?nStudy of abstract computing devices, or machines nAutomaton = an abstract computing devicenNote:A device need not even be a physical hardware!nA fundamental question in computer science: nFind out what different models of machines can do and cannot donThe Theory of computationnComputability vs. Complexity3 Alan Turing (1912-1954)nFather of Modern Computer SciencenEnglish mathematiciannStudied abstract machines called Turing machineseven before computers existednHeard of the Turing test?(A pioneer of Automata Theory )4 Theory of Computation: A Historical Perspective1930s Alan Turing studies Turing machines Decidability Halting problem1940-1950s Finite Automata machines studied Noam Chomsky proposes the Chomsky Hierarchy for formal languages1969 Cook introduces intractable problemsor NP-Hard problems1970-Modern computer science: compilers, computational & complexity theoryevolve5 Languages & GrammarsOr words Image source: Nowak et al.
A string or word is a finite sequence of symbols ... (part of city name) Should end w/ 2-letter state code. 16 Formal Proofs. 17 Deductive Proofs From the given statement(s) to a conclusion statement (what we want to prove) n Logical progression by direct implications
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}