Scribd
Upload
187 views

Automata Theory & A Historical Perspective: Alan Turing (1912-1954) Father of Modern Computer Science

Automata theory studies abstract machines called automata. Alan Turing is considered the father of modern computer science. There is a hierarchy of classes of formal languages called the Chomsky hierarchy, with finite automata being the simplest type. Finite automata have applications in software for designing digital circuits, lexical analysis in compilers, and pattern finding in text. Automata theory examines alphabets, strings, languages, and the membership problem of determining if a string is in a language.

Uploaded by

Do Min Joon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
187 views

Automata Theory & A Historical Perspective: Alan Turing (1912-1954) Father of Modern Computer Science

Automata theory studies abstract machines called automata. Alan Turing is considered the father of modern computer science. There is a hierarchy of classes of formal languages called the Chomsky hierarchy, with finite automata being the simplest type. Finite automata have applications in software for designing digital circuits, lexical analysis in compilers, and pattern finding in text. Automata theory examines alphabets, strings, languages, and the membership problem of determining if a string is in a language.

Uploaded by

Do Min Joon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Automata theory & a historical perspective

In theoretical computer science, automata theory is the study of mathematical objects called abstract
machines or automata and the computational problems that can be solved using them. Automata
comes from the Greek word meaning "self-acting". Study of abstract computing devices, or
machines

Alan Turing (1912-1954) Father of Modern Computer Science

Chomsky hierarchy

A containment hierarchy of classes of formal languages

Finite automata
Some Applications
Software for designing and checking the behavior of digital circuits
Lexical analyzer of a typical compiler
Software for scanning large bodies of text (e.g., web pages) for pattern finding
Software for verifying systems of all types that have a finite number of states (e.g., stock market
transaction, communication/network protocol)

Alphabets, strings/words/sentences, languages
>Alphabet
An alphabet is a finite, non-empty set of symbols
We use the symbol (sigma) to denote an Alphabet
>String/Word/Sentence
A string or word is a finite sequence of symbols chosen from .
Empty string is (or epsilon)
>Languages
L is a said to be a language over alphabet , only if L *
this is because * is the set of all strings (of all possible length including 0) over the given
alphabet .

Membership problem
Given a string w *and a language L over , decide whether or not w L.

Proofs:
Deductive, induction, contrapositive, contradiction,
counterexample:

Deductive
From the given statement(s) to a conclusion statement (what we want to prove).
Logical progression by direct implications.

By contradiction
Start with the statement contradictory to the given statement
E.g., To prove (A => B), we start with: (A and ~B) and then show that could never happen
What if you want to prove that (A and B => C or D)?
By induction
(3 steps) Basis, inductive hypothesis, inductive step 20
By contrapositive statement
If A then B If ~B then ~A
By counter-example
Show an example that disproves the claim

Note: There is no such thing called a proof by example! So when asked to prove a claim, an example
that satisfied that claim is not a proof

If and only if
A if and only if B (A <==>
B)

UNDERSTANDING
In theoretical computer science, automata theory is the study of mathematical objects called abstract
machines or automata and the computational problems that can be solved using them. Automata
comes from the Greek word meaning "self-acting". Automaton is a self-operating machine or
robot. A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state
machine, is a mathematical model of computation used to design both computer programs and
sequential logic circuits. It is conceived as an abstract machine that can be in one of a finite number of
states.
Submitted by: Cherry Mae chem Zerna

You might also like