Trac 13774: Irreducible Cartan types created as reducible
Review patch for #13774.
Use Brzozowski as default for minimizing non-deterministic automata
add_transistions_from_function now also allows a list of transitions.
fixed incorrectly announced TypeError in FiniteStateMachine.add_from_transition_function

Old behaviour:
sage: def transition(state, where):
sage: ...    return (vector([0,0]),1)
sage: Transducer(transition, input_alphabet=[0], initial_states=[0])
Traceback (click to the left of this block for traceback)
...
ValueError: The callback function for add_from_transition is expected to
return a pair (new_state, output_label) or a list of such pairs. For the
state 0 and the input letter 0, it however returned [((0, 0), 1)], which
is not acceptable.

New behaviour:
sage: def transition(state, where):
sage: ...    return (vector([0,0]),1)
sage: Transducer(transition, input_alphabet=[0], initial_states=[0])
Traceback (click to the left of this block for traceback)
...
TypeError: mutable vectors are unhashable
For prepone_output, output must be hashable: documented.
Allow non-hashable output labels in prepone_output
Correct whitespace error
spacings in add_transitions_from_function; comma in docstring
corrected spacings and rewrote long line in add_from_transition_function
docstring (INPUT) of minimization rewritten
Merge branch 'public/combinat/root_systems/reducibles-13774' of trac.sagemath.org:sage into public/combinat/root_systems/reducibles-13774
Added Cartan matrix doctest.
corrected spacings (PEP8); () to tuple(); rewrote "== []"
Merge branch 'fsm/default-order-states-transitions' into fsm/prepone-output-unhashable-output

* fsm/default-order-states-transitions:
  rewrote docstring of .__lt__ in FSMState/FSMTransition; corrected spacings
Merge branch 'fsm/default-order-states-transitions' into fsm/prepone-output-unhashable-output

* fsm/default-order-states-transitions:
  added one spaceing (PEP8)
inserted "the" in docstring of minimization
Trac 13609: fix symbolic expression auto evaluation when content is in GF(2^k)

This fixes Pynac issue #12 (http://hg.pynac.org/pynac/issue/12).

If the content of an add expression is in GF(2^k) the normalization code that
extracts the content led to an infinite loop. This patch adds doctests for the
fix in Pynac.
Merge branch 'public/combinat/root_systems/reducibles-13774' of trac.sagemath.org:sage into cartan
microfixes