Recognizing Automaton

( 306, 257)(0,0) ( 11, 237) X = A + B * C (0, 232) ( 154, 22) ( 26, 254) (0,-1) 22 ( 48, 254) (0,-1) 22 ( 70, 254) (0,-1) 22 ( 90, 254) (0,-1) 22 ( 110, 254) (0,-1) 22 ( 129, 254) (0,-1) 22 ( 77, 232) (-2,-5)8 ( 69, 213) (1,0) 16 ( 77, 232) ( 2,-5)8 ( 78, 214) (0,-1) 48 ( 58, 142) Finite ( 54, 122) Control ( 43, 101) ( 82, 66) ( 46, 26) Auxiliary ( 52, 6) Memory ( 43,0) ( 82, 45) ( 81, 74) (0,1)27 ( 81, 74) (0,-1)29

The Finite Control (a program with finite memory) reads symbols from the input tape one at a time, storing things in the Auxiliary Memory.

The recognizer answers Yes or No to the question ``Is the input string a member of the language?''

Contents    Page-10    Prev    Next    Page+10    Index