Programming challenge: wildcard exclusion in cartesian products

"And it doesn't really matter what language you use to implement this
algorithm, it's the idea that counts. Notation aside, all
implementations will be quite similar."

I'll guess I'll get out my Turing tape. :wink:

What are some good references for finite state machines? Minimization?

A classic is "Introduction to automata theory, languages and computation"
by Hopcroft and Ullman. But any other book about finite state machines
should cover these topics, too. There are good chances that you can just
google for a detailed explanation.

- Dirk

···

wkehowski@cox.net <wkehowski@cox.net> wrote:

What are some good references for finite state machines? Minimization?