Machines That Eat Your Words (MegaMath)
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Nancy Casey; Los Alamos National Laboratory|
|An introduction to the concept of finite state machines, and how they are used to design computer systems that will recognize patterns. A finite state machine is an imaginary (or abstract) machine that is used to study and design systems that recognize and identify patterns. The idea of a finite state machine is a powerful one that has many applications in computer science. Mathematics as Problem Solving, Mathematics as Communication, Mathematics as Reasoning, and Mathematical Connections are critical items throughout the NCTM Standards. They appear at every level because they form the core of what it means to do mathematics.|
|Levels:||Elementary, Middle School (6-8), High School (9-12)|
|Resource Types:||Lesson Plans and Activities|
|Math Topics:||Patterns/Relationships, Computer Systems|
|Math Ed Topics:||Curriculum/Materials Development|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.