Wrong decision in "Fast run" and "Multiple run"

[magsilva]

When evaluating the Turing machine for Exercise 8 from Chapter 9 (ex9.5ttm-whatlang-a.jff), which recognizes the language |a|n = |b|(2*n), the results in "Fast run" and "Multiple run" for the string "aaabbbbbb" is incorrect. JFlap rejects it, when it should accept it (as it indeed does when running step by step).

[Naahbi]

I have a similar problem. When computing the input in a multi-tape machine, if jflap is running step by step, it accepts, in fast run it rejects. Have u fixed the problem?