[benchmarks] Make aut_complete compatible with LAL.

Label transitions with 'a' instead of epsilon.

* src/bench/common/bench_constructs.hh: Enable aut_complete,
Use add_transition instead of add_spontaneous.
* src/bench/common/README_AUTOMATA,
* src/bench/accessible/accessible_bench.hh: Update description.

ChangeLog

+2009-11-19  d-halluin  <d-halluin@lrde.epita.fr>
+
+	[benchmarks] Make aut_complete compatible with LAL.
+
+	Label transitions with 'a' instead of epsilon.
+
+	* src/bench/common/bench_constructs.hh: Enable aut_complete,
+	Use add_transition instead of add_spontaneous.
+	* src/bench/common/README_AUTOMATA,
+	* src/bench/accessible/accessible_bench.hh: Update description.
+
 2009-11-19  d-halluin  <d-halluin@lrde.epita.fr>
 	[benchmarks] Get OPENFST_PATH in a more portable way than expr.

src/bench/accessible/accessible_bench.hh

@@ -45,7 +45,8 @@ void accessible_bench(int n)
               "using Vaucanson.\n"
 	      "\n"
 	      "Input is a complete automaton with n states:\n"
-	      "Between any two states, there exists a spontaneous transition.\n"
+	      "Between any two states, there is a transition labeled "
+	      "with 'a'.\n"
 	      "(see src/bench/common/README_AUTOMATA for aut_complete).\n"
 	      "\n"
 	      "Process:\n"

src/bench/common/README_AUTOMATA

@@ -41,7 +41,7 @@ A simple automaton that recognizes words containing `b' on the
 ==================
 
 A complete automaton on the `a' alphabet:
-For any two states, there exists a spontaneous transition between
+For any two states, there exists a transition labeled with 'a' between
 the two states.
 
 * n states.

src/bench/common/bench_constructs.hh

@@ -172,9 +172,8 @@ automaton_t aut_b()
   return a;
 }
 
-
 /// Create a aut_complete automaton
-/// (spontaneous transition between any two states).
+/// (Transition between any two states).
 /// See README_AUTOMATA for aut_complete.
 automaton_t aut_complete(int n)
 {
@@ -193,7 +192,7 @@ automaton_t aut_complete(int n)
 
   for (std::vector<hstate_t>::iterator i = state_list.begin(); i != state_list.end(); ++i)
     for (std::vector<hstate_t>::iterator j = state_list.begin(); j != state_list.end(); ++j)
-      a.add_spontaneous(*i, *j);
+      a.add_letter_transition(*i, *j, 'a');
 
   return a;
 }