Uses of Class
ro.inf.p2.odd.alan.Tape

Uses of Tape in ro.inf.p2.odd.alan
 

Subclasses of Tape in ro.inf.p2.odd.alan
 class TuringMachine
          Class TuringMachine This class implements a complete Turing Machine which is described by the formula M = (Q,Sigma, Gamma, delta, q0, B, F) where: - Q is a finite set of states - Gamma is a finite set of the tape alphabet - Sigma is a finite set of the input symbols (subset of Gamma) - delta is the set of transistion functions - q0 is the initial state (member of Q) - B is the BLANK symbol - F is set of final accepting states (subset of Q) You can either execute the turing machine with execute and just get the results or walk step by step through the execution using start() and nextStep().
 

Constructors in ro.inf.p2.odd.alan with parameters of type Tape
TapeGUI(Tape tape)