also coerce final output

sagemath · Oct 5, 2014 · 8e0b5cc · 8e0b5cc
1 parent c8d91d0
commit 8e0b5cc
Showing 1 changed file with 5 additions and 1 deletion.
diff --git a/src/sage/combinat/finite_state_machine_generators.py b/src/sage/combinat/finite_state_machine_generators.py
@@ -801,6 +801,8 @@ def Recursion(self, recursions, function, var, base,
                 ....:     print t.word_out[0].parent()
                 Integer Ring
                 Integer Ring
+                sage: T.states()[0].final_word_out[0].parent()
+                Integer Ring
 
             In contrast, if ``output_rings`` is set to the empty list, the
             results are not coerced::
@@ -816,6 +818,8 @@ def Recursion(self, recursions, function, var, base,
                 AttributeError: 'int' object has no attribute 'parent'
                 sage: T.transitions()[1].word_out[0].parent()
                 Symbolic Ring
+                sage: T.states()[0].final_word_out[0].parent()
+                Symbolic Ring
 
             Finally, we use a somewhat questionable coercion::
 
@@ -1107,7 +1111,7 @@ def parse_equation(equation):
                                  "in %s." % (left_side.operands()[0],
                                             var))
             if polynomial_left in base_ring and is_scalar(right_side):
-                initial_values[polynomial_left] = right_side
+                initial_values[polynomial_left] = coerce_output(right_side)
                 return
 
             if polynomial_left.degree() != 1: