Formal Languages

1
Formal Languages Automata

2
Formal Languages Automata

• A formal language
• Is an abstraction of the general characteristics
  of programming languages.
• Consists of a set of symbols and some formation
  rules by which these symbols can be combined into
  sentences.

3
Formal Languages Automata

• An automaton
• Is a construct that possesses all the
  indispensable features of a digital computer.
• Accepts input, produces output, may have some
  temporary storage, and can make decisions in
  transforming the input into the output.

4
Formal Languages Automata
An introduction to the fundamental ideas and
models underlying computing.

• Computational power
• Non-computable functions
• Computational complexity
• Intractable problems

5
Formal Languages Automata
Some immediate and important applications.

• Digital design
• Programming languages
• Compilers

6
Formal Languages Automata

• Assessment
• Midterm exam 30
• Final exam 60
• Presentation assignments 10

7
Formal Languages Automata

• References
• Giáo trình lý thuy?t automat và ngôn ng? hình
  th?c.
• H? Van Quân
• An introduction to formal languages and automata.
• Peter Linz
• Introduction to automata theory, languages, and
  computation.
• John Hopcroft Jeffrey Ullman