

MODULE 1 LESSON 1 ACTIVITY Mark Joshua Reyes

LEARNING ACTIVITY

Question: Define finite automata, pushdown automata and Turing machine?

Finite Automata are devices with finite amount of memory and is used to model small
computers, Pushdown automata are devices with infinite memory that can be accessed in
a restricted way, and is used to parse grammars, while Turing Machine is an abstract
model of modern-day computer execution and storage, developed in order to provide a
precise mathematical definition of an algorithm or mechanical procedure.