On Tue, Jul 23, 2013 at 01:16:33PM -0400, Daniel C. wrote: > I figured I'd try something on topic for once. > > Is it possible to write a program that accepts an input N and then > generates all possible finite state automatons which have N states?
I assume the alphabet is fixed and finite, right? -- Andrew McNabb http://www.mcnabbs.org/andrew/ PGP Fingerprint: 8A17 B57C 6879 1863 DE55 8012 AB4D 6098 8826 6868 /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
