quantum Computing

Eli Brandt ebrandt at jarthur.cs.hmc.edu
Wed May 18 14:55:44 PDT 1994


> From: Rick Busdiecker <rfb at lehman.com>
> It's a matter of definition, I suppose.  Hopcroft and Ullman describe
> an NFA as having a tape.

I find this a little odd, given that the "F" stands for "finite".
Checking Hopcroft and Ullman, they define an NFA formally as a
tuple: states, inputs, initial state, final states, and a mapping
from states cross inputs to 2^states.  No tape.

   Eli   ebrandt at hmc.edu







More information about the cypherpunks-legacy mailing list