On Sun, 11 Jan 2015 06:20:34 -0800, Rustom Mody wrote:
> A favorite example of mine is automata-acceptance: > If > δ : Q × Σ → Q is a transition function > F is the set of final states > q₀ is the start state > and s is a string > > then > reduce(δ,q₀,s) ∈ F > expresses "automaton accepts string s" > > Should that go into the doc?? Absolutely. :-) If the docs had explained that reduce is actually a finite state machine framework, then I wouldn't have written my such framework. > I'll leave that to somebody else whose name starts with 'R' :-) Uh, oh. Sorry. -- Dan Sommers, neither of which begins with an 'R' -- https://mail.python.org/mailman/listinfo/python-list