Jump to content

Wikipedia:Articles for deletion/Two-way finite state machines

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hyperzonk (talk | contribs) at 19:27, 14 February 2005 (Is my method for deciding how to VfD describable as a finite state machine? Probably not.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A simple exercise in logic, but not encyclopedic. Radiant! 15:49, Feb 14, 2005 (UTC)

  • It looks like an exercise set for someone's homework. Well, they're already a term late in handing it in. Delete and let the redlink at Finite state machine do its job. Uncle G 17:17, 2005 Feb 14 (UTC)
  • Keep, has instinct --219.77.226.8 17:18, 14 Feb 2005 (UTC)
  • Delete. It does look like homework. Perhaps from a "Theory of Computation" class? Carrp | Talk 17:22, 14 Feb 2005 (UTC)
  • Redirect to Finite state machine -- As I recall from my "Theory of Computation" class, a two-way finite state machine is just a variation of a Finite state machine. Zzyzx11 19:19, 14 Feb 2005 (UTC)
  • Keep. Finite state machine links to this page from a list of other types of machines, all of which have their own entries and most of which are far more fully realized articles. This probably just needs to be extensively expanded. Not sure that it "shows instinct" however. :) HyperZonk 19:27, Feb 14, 2005 (UTC)