Reinstate over-hasty removal of listg (r2489).
	* include/Makefile.am: .
	* include/vaucanson/automata/implementation/listg/iterator.hh: New.
	* include/vaucanson/automata/implementation/listg/iterator.hxx: New.
	* include/vaucanson/automata/implementation/listg/listg_handlers.hh: New.
	* include/vaucanson/automata/implementation/listg/listg_handlers.hxx: New.
	* include/vaucanson/automata/implementation/listg/listg_sparse_interval.hh: New.
	* include/vaucanson/automata/implementation/listg/listg_sparse_interval.hxx: New.
	* include/vaucanson/automata/implementation/listg: New.
	* include/vaucanson/automata/implementation/listg_graph_impl.hh: New.
	* include/vaucanson/automata/implementation/listg_graph_impl.hxx: New.

	Vaucanswig won't compile any more owing to the lack of listg. Since it
	is broken anyway, it seems a small extra benefit to compile it during
	make distcheck.
	* Makefile.am: .

	Entia non sunt multiplicanda praeter necessitatem.
	* include/vaucanson/automata/implementation/bmig_graph_impl.hh: .

	To simplify ongoing work, remove the listg graph implementation.
	The framework for multiple implementations is retained for ease of
	adding or changing the graph implementation in future.
	* include/Makefile.am: .
	* include/vaucanson/automata/implementation/listg/iterator.hh: Remove.
	* include/vaucanson/automata/implementation/listg/iterator.hxx: Remove.
	* include/vaucanson/automata/implementation/listg/listg_handlers.hh: Remove.
	* include/vaucanson/automata/implementation/listg/listg_handlers.hxx: Remove.
	* include/vaucanson/automata/implementation/listg/listg_sparse_interval.hh: Remove.
	* include/vaucanson/automata/implementation/listg/listg_sparse_interval.hxx: Remove.
	* include/vaucanson/automata/implementation/listg: Remove.
	* include/vaucanson/automata/implementation/listg_graph_impl.hh: Remove.
	* include/vaucanson/automata/implementation/listg_graph_impl.hxx: Remove.

	* src/tests/sanity/Makefile.am: .

	[r]delta_state_iterator was poorly designed (the name was
	used to express a type), and not needed	(it was only used
	twice, and dst_of and src_of are convenient
	to use instead).

	Since that only leaves one flavour, [r]delta_transition_iterator,
	it is now called [r]delta_iterator.
	* include/vaucanson/algorithms/accessible.hxx: .
	* include/vaucanson/algorithms/aut_to_exp.hxx: .
	* include/vaucanson/algorithms/complete.hxx: .
	* include/vaucanson/algorithms/determinize.hxx: .
	* include/vaucanson/algorithms/eps_removal.hxx: .
	* include/vaucanson/algorithms/eps_removal_sp.hxx: .
	* include/vaucanson/algorithms/eval.hxx: .
	* include/vaucanson/algorithms/internal/evaluation.hxx: .
	* include/vaucanson/algorithms/internal/has_neighbour.hxx: .
	* include/vaucanson/algorithms/internal/outsplitting.hxx: .
	* include/vaucanson/algorithms/is_deterministic.hxx: .
	* include/vaucanson/algorithms/letter_to_letter_composition.hxx: .
	* include/vaucanson/algorithms/minimization_hopcroft.hxx: .
	* include/vaucanson/algorithms/minimization_moore.hxx: .
	* include/vaucanson/algorithms/normalized_composition.hxx: .
	* include/vaucanson/algorithms/product.hxx: .
	* include/vaucanson/algorithms/rw_composition.hxx: .
	* include/vaucanson/algorithms/search.hxx: .
	* include/vaucanson/algorithms/standard.hxx: .
	* include/vaucanson/algorithms/standard_of.hxx: .
	* include/vaucanson/algorithms/sum.hxx: .
	* include/vaucanson/automata/concept/automata_base.hh: .
	* include/vaucanson/automata/implementation/bmig/iterator.hh: .
	* include/vaucanson/automata/implementation/bmig/iterator.hxx: .
	* include/vaucanson/automata/implementation/bmig_graph_impl.hh: .
	* include/vaucanson/automata/implementation/bmig_graph_impl.hxx: .
	* include/vaucanson/automata/implementation/listg/iterator.hh: .
	* include/vaucanson/automata/implementation/listg/iterator.hxx: .
	* include/vaucanson/automata/implementation/listg_graph_impl.hh: .
	* include/vaucanson/automata/implementation/transpose_view.hh: .
	* include/vaucanson/misc/usual_macros.hh: .
	* include/vaucanson/tools/fsm_dump.hxx: .
	* include/vaucanson/tools/gen_random.hxx: .
	* src/tests/include/tests/automata/implementation_check/iterator_test.hh: .
	* taf-kit/src/edition_commands.hxx: .

	* src/tests/include/tests/automata/algos/letter_combination_labeled_graphs/product_test.hh:
	  This test was taking far too long. Reduce size drastically from (10, 20) to (2, 4).

	The delta_transition_iterator's and delta_state_iterator's are used
	instead.
	* include/vaucanson/algorithms/accessible.hxx: .
	* include/vaucanson/algorithms/aut_to_exp.hxx: .
	* include/vaucanson/algorithms/complete.hxx: .
	* include/vaucanson/algorithms/determinize.hxx: .
	* include/vaucanson/algorithms/eps_removal.hxx: .
	* include/vaucanson/algorithms/eps_removal_sp.hxx: .
	* include/vaucanson/algorithms/eval.hxx: .
	* include/vaucanson/algorithms/internal/evaluation.hxx: .
	* include/vaucanson/algorithms/internal/outsplitting.hxx: .
	* include/vaucanson/algorithms/is_deterministic.hxx: .
	* include/vaucanson/algorithms/letter_to_letter_composition.hxx: .
	* include/vaucanson/algorithms/minimization_hopcroft.hxx: .
	* include/vaucanson/algorithms/minimization_moore.hxx: .
	* include/vaucanson/algorithms/normalized_composition.hxx: .
	* include/vaucanson/algorithms/product.hxx: .
	* include/vaucanson/algorithms/rw_composition.hxx: .
	* include/vaucanson/algorithms/search.hxx: .
	* include/vaucanson/algorithms/standard.hxx: .
	* include/vaucanson/algorithms/standard_of.hxx: .
	* include/vaucanson/algorithms/sum.hxx: .
	* include/vaucanson/automata/concept/automata_base.hh: .
	* include/vaucanson/automata/concept/automata_base.hxx: .
	* include/vaucanson/automata/concept/automata_ops.hh: .
	* include/vaucanson/automata/concept/automata_ops.hxx: .
	* include/vaucanson/automata/concept/kinds.hh: .
	* include/vaucanson/automata/concept/kinds.hxx: .
	* include/vaucanson/automata/implementation/automaton_view.hh: .
	* include/vaucanson/automata/implementation/automaton_view.hxx: .
	* include/vaucanson/automata/implementation/bmig_graph_impl.hh: .
	* include/vaucanson/automata/implementation/bmig_graph_impl.hxx: .
	* include/vaucanson/automata/implementation/listg_graph_impl.hh: .
	* include/vaucanson/automata/implementation/listg_graph_impl.hxx: .
	* include/vaucanson/automata/implementation/transpose_view.hh: .
	* include/vaucanson/automata/implementation/transpose_view.hxx: .
	* include/vaucanson/tools/fsm_dump.hxx: .
	* include/vaucanson/tools/gen_random.hxx: .
	* src/benchs/iterators/iterator_bench.hh: .
	* src/demos/algorithms/universal.cc: .
	* src/demos/one_rule_rewriting/shortest.hh: .
	* src/tests/include/Makefile.am: .
	* src/tests/include/tests/automata/algos/boolean_rw_transducers/invert_test.hh: .
	* src/tests/include/tests/automata/algos/letter_combination_labeled_graphs/transition_container_test.hh: .
	* src/tests/include/tests/automata/implementation_check/rdelta_test.hh: Remove.
	* taf-kit/src/edition_commands.hxx: .

	* include/vaucanson/automata/implementation/bmig_graph_impl.hh:
	  "adresse" -> "address" and "guaranties" -> "guarantees".

	* include/vaucanson/contexts/automaton_maker.thh,
	* include/vaucanson/contexts/automaton_maker.thxx,
	* include/vaucanson/contexts/fmp_transducer_maker.thh,
	* include/vaucanson/contexts/fmp_transducer_maker.thxx: Remove
	  default arguments. Add a function that do not need
	  representations.

	* data/automata/char-fmp-b/Makefile.am,
	* data/automata/char-b/Makefile.am,
	* data/automata/char-z/Makefile.am: Change `dist' prefix to `nodist'.
	* data/automata/char-b/Makefile.am,
	* data/automata/char-fmp-b/Makefile.am: Remove useless `EXTRA_DIST'
	  variable.

	* doc/HACKING.txt: Document some hints for a rapid build.
	  Some are annotated with FIXMEs. Thanks very much to Jerome
	  (sorry, J, but svn-commit.sh won't let me type the accents
	  in your name) for suggesting a LARGE ccache, which helps
	  enormously when making small changes. There is no excuse not
	  to use all these techniques with the exception of distcc, and,
	  if you're interested in performance, non-optimization.

	* data/emacs/vaucanson.el: Vaucanson requires tabs (at least,
	  looking at vaucansonize-buffer), so make the c-style also
	  enforce this.

No commit message

	* configure.ac: Change version number.
	* doc/NEWS.txt: Update for release.
	* doc/share/styles/myacronym.sty: make share-up.

	* taf-kit/src/common.hh [WITH_TWO_ALPHABETS] (arguments_t): Add a
	  new attribute `alphabet1'. New `add_parser1_option'.
	* taf-kit/src/edition_commands.hxx [WITH_TWO_ALPHABETS]
	  (edit_automaton_command): Use the new `alphabet1' instead of
	  `alphabet'.
	* taf-kit/src/main.cc [WITH_TWO_ALPHABETS] (parse_opts): Use
	  `alphabet1' and `parser1' instead of `alphabet' and `parser'.
	  [WITH_TWO_ALPHABETS] (main): Cleanup parser declarations.
	* taf-kit/src/parser_options.hh,
	* taf-kit/src/parser_options.hxx: Make `parser_options' a
	  parametrized type by templating it with the monoid representation
	  and the series representation types.

	* src/tests/xml/int_fmp_ref.dot,
	* src/tests/xml/int_z_fmp_ref.dot: Revert the new default to `1'.

	* include/vaucanson/xml/contexts/fmp.hxx: Here.
	* include/vaucanson/xml/xmleq.hxx (XMLEq): Rename `concatSym' to
	  `timesSym'.

	* include/vaucanson/tools/gen_random.hxx: Do not test against
	  epsilon representation anymore.

	* include/vaucanson/algebra/concept/freemonoid_product.hh
	  (monoid_rep): Add missing `using' declarations.
	* include/vaucanson/algebra/implementation/monoid/free_monoid.hxx,
	* include/vaucanson/algebra/concept/freemonoid_product.hxx
	  (monoid_rep::monoid_rep): Build a list of realistic epsilon values.
	* include/vaucanson/algebra/implementation/monoid/free_monoid.hh
	  (monoid_rep): Add missing `using' declaration. Update comments on
	  constructors to reflect the new mechanism.
	* include/vaucanson/algebra/implementation/monoid/free_monoid.hxx
	  (FreeMonoid): Add a simple heuristic to choose an epsilon wisely,
	  when not given a user representation.
	* include/vaucanson/algebra/implementation/monoid/monoid_rep.hh:
	  Include `vector'. (monoid_rep): Add a new attribute.
	* include/vaucanson/algebra/implementation/monoid/monoid_rep.hxx:
	  Include missing `monoid_rep.hh'. Build a default epsilon list.

	* include/vaucanson/algebra/concept/freemonoid_product.hh
	  (FreeMonoidProduct): Add a public method `set_representation'.
	* include/vaucanson/algebra/concept/freemonoid_product.hxx: Add the
	  implementation of the aforementioned function.

	* include/vaucanson/automata/implementation/transpose_view.hh
	  (automaton_traits): Reverse the direction of iterators on the
	  transposed automaton.
	* src/tests/include/tests/automata/implementation_check/iterator_test.hh:
	  Improve the test by adding a regression check for this bug.