1. Home
  2. MERLOT Materials
  3. Material Detail: Treasure Hunt: Finite-State Automata

Material Detail

Treasure Hunt: Finite-State Automata

Treasure Hunt: Finite-State Automata

In this computer science activity about finite-state automaton (on page 45 of the PDF), learners use a map and choose various pathways to find Treasure Island. They learn that different pathways will lead them to dead-ends, continuous circles, or to their goal. This activity includes a simpler demonstration activity and one whole class activity. Background information about finite-state automaton and computer programming is included....

Show More
Keywords:
Information Technology, Program, NSDL, Mathematics, Programming, Routing, Information, Process, Algorithm, Data Collection, Computers, Computing and Information, Engineering, Technology, Computer Science, General, Information and Communication, Information Systems, Data Representation, User Dependent, Education, Data Analysis, Automaton
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • Peer Review
  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Simulation
Date Added to MERLOT:
July 27, 2016
Date Modified in MERLOT:
December 9, 2017
Authors:

Submitter:
Barbra Bied Sperling
Hispanic Serving Institution
Primary Audience:
Grade School, Middle School
Technical Format:
Website
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
Unknown
Source Code Available:
No
Creative Commons:
Unknown

Browse...

Disciplines with similar materials as Treasure Hunt: Finite-State Automata
People who viewed this also viewed
Other materials like Treasure Hunt: Finite-State Automata

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.