A conceptual model of a computer (or a computer program) which represents the conputation in terms of a finite number of states and transitions between them. This is the closest commonly used paradigm to the TuringMachine and is widely used in parsers. Often implmented with the much-maligned Goto?.
