Chapter 13: Finite Automata and Languages

1
Chapter 13 Finite Automata and Languages

• Discrete Mathematical Structures
• Theory and Applications

2
Learning Objectives

• Learn about various types of automata and their
  basic properties
• Learn about regular grammars and their
  relationship with various types of automata
• Become familiar with finite state machines
• Learn about various types of grammars

3
Finite Automata and Regular Languages
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
(No Transcript)
24
(No Transcript)
25
(No Transcript)
26
Finite State Machines with Input and Output
27
(No Transcript)
28
(No Transcript)
29
(No Transcript)
30
(No Transcript)
31
(No Transcript)
32
(No Transcript)
33
(No Transcript)
34
(No Transcript)
35

• Example 13.2.12 (Continued)

36
(No Transcript)
37

• Suppose the cost of a newspaper is 25 cents. The
  machine accepts any sequence of 5-, 10-, or 25-
  cent coins. After inserting at least 25cents, the
  customer can press the button to release the
  newspaper. For simplicity, assume that if a
  customer inputs more than 25 cents, then the
  machine does not return the change. Moreover,
  after selling the newspaper, the machine returns
  to the initial state i.e., it is ready to
  process the next request. Construct a finite
  state machine that models this vending machine.

38
Grammars and Languages
39
(No Transcript)
40
(No Transcript)
41
(No Transcript)
42
(No Transcript)
43
(No Transcript)
44
(No Transcript)
45
(No Transcript)
46
(No Transcript)
47
(No Transcript)
48
(No Transcript)
49
(No Transcript)
50
(No Transcript)
51
(No Transcript)
52
(No Transcript)