Bug List

Class BerrySethiAlgo

FIXME: Change the zero-letter.

FIXME: Check efficiency.

FIXME: Check results of derivation.

Member BerrySethiAlgo (const series_set_t &series, const exp_t &exp)

FIXME: Is it necessary to give the series as a separate argument?

Member on_state (const Exp &e)

FIXME: Optimize!

Member alphabet ()

FIXME: this interface should not exist (s.e. are const once instantiated)

Class Graph

FIXME: This stuff is not sufficiently documented.

Class KRatExpAciCanonical

FIXME: The algorithm is correct, but the implementation may not be efficient!

Class PRatExpDerivationVisitor

FIXME: This class heavily lacks of documentation.

FIXME: Make list be a unique container.

Member SetSlotAttribute (const S &other)

For a number of reasons (see the mailing list), this constructor creates a fresh copy on the heap which is never deallocated.

Class SupportIterator

is not STL compliant yet.

File evaluation.hh

FIXME: Document!

File letter_to_letter_composition.hh

FIXME: Document!

File projection.hh

FIXME: Document!

File realtime_composition.hh

FIXME: Document!

Member op_contains (const algebra::Series< W, M > &s, const rat::exp< Tm, Tw > &m)

FIXME Operators in krat.hxx are of the form:

Member op_in_mul (const algebra::Series< W, M > &s, rat::exp< Tm, Tw > &dst, const rat::exp< Tm, Tw > &arg)

FIXME: Add the following transformation in a separated function.

Member op_in_mul (const algebra::Series< W, M > &s, const W &semiring, rat::exp< Tm, Tw > &ret, const oTw &w)

FIXME: Add the following transformation in a separated function.

Member op_mul (const W &semiring, const algebra::Series< W, M > &s, const oTw &w, const rat::exp< Tm, Tw > &b)

FIXME: Add the following transformation in a separated function.

Member do_closure_here (const AutomataBase< A_ > &, Auto &a, bool bck_fwd)

FIXME: This converters should be removed

Member do_determinize (const AutomataBase< A > &a_set, output_t &output, const input_t &input, std::map< hstate_t, std::set< hstate_t > > &m)

FIXME: for the moment, it uses subset_construction and trim but it must be rewritten to do the twice at the same time more efficiently.

Member minimization_moore (const Element< A, T > &a)

Put the precondition.

Member search (const Element< Automata< Series >, T > &a, const InputIterator &begin, const InputIterator &end, typename Element< Automata< Series >, T >::letter_t eol, FoundFunctor &f)

Multiple implementations of search() should be implemented. When a call to search is performed an heuristic should decide which implementation to use. For the moment there is no such mechanism since only one implementation of search is provided.

Member standardize (Element< A, T > &a)

Not implemented yed

---