Burton Rosenberg
April 25, 2015

Gloss of diagrams, for a turing machine to read from a name-value datastore.

There are two tapes, D, T. D contains name values pairs written over some 
alphabet S, each word delimited by the reserved blank symbol, _, and 
the ends of the taped marked with some reserved symbol #.

The transfer tape T starts with a name, which is replaced by the associated
value as paired in D.

The following compound states are defined:


X1: given head over blanks on D and T tapes, compares the next
	word for equality.
	
	exits to one of two states depending on equality or inequality.
	
	leaves head over blanks in D and T tapes after the compared words.
	
X2: given head over blank on the D tape, moves head R over next word to next
	blank.
	
X3: given head over blank on T tape, moves head L over previous word to previous
	blank.
	
X4: given head over blanks on D and T tapes, compares repeatedly the names
	for equality
	
	leaves heads over the blanks following the matched names

X5: given head over blank at end of T tape, erases tape and leaves head over first
	cell of tape
	
X6: given heads over blanks on D and T tapes, copies next word on D tape to T tape
	leaving heads at the blank follow the word
	
X7: moves head Left to start of D tape

R:	given head over # on D tape, over _ on T tape, finds match of names and replaces
	name on T tape with found value


Data format:

	D tape is: #_((S+)_(S+))*_# where first S+ is name, second S+ is value
	T tape is: _(S+)_ before, and _(S+)_ 

Assumes name given by T before is paired in dictionary D with a value (i.e. 
matching name is found in dictionary).

The arrows are coded as:
	
	Da -> Db,DL	if tape D as a, replace by b and move D head left
	Da,Tb -> Dc,Td,DL,TR 
			if tape D has a AND tape T has b, replace a by c, 
			b by d, move tape D head left, and tape T head right
	DTb -> DTR	short for Db,Tb -> DR, TR