ppt课件-computer science unplugged（计算机科学不插电）.pptVIP

TREASURE HUNT Computer programs often need to process a sequence of symbols such as words in a document or even the text of another program. Computer scientists use a Finite State Automaton (FSA), a set of instructions to see if the sequence is acceptable or not. This exercise uses the FSA idea using treasure maps! TREASURE HUNT Goal: Find Treasure Island Start: from Pirates Island Friendly pirate ships sail along fixed routes between islands offering rides to travelers. Each island has two departing ships, A and B. Determine all possible sequences of ships that a traveler can take to arrive