As a consequence, the trait bounds of most automata types have moved further out of the library core. This means that the underlying implementations BTS and HashTS only assume a minimum of bounds on the type of state and edge colors Q and C respectively. This means that the MooreLike and MealyLike traits have pretty much become useless, as they still require the user to specify a bound on the edges.
This will be addressed, once #35 is tackled since a better (unifying) Automaton type will allow Moore and Mealy machines to be simple type aliases for some specific instantiation of Automaton.
This implements the
Voidtype mentioned in #46 .As a consequence, the trait bounds of most automata types have moved further out of the library core. This means that the underlying implementations
BTSandHashTSonly assume a minimum of bounds on the type of state and edge colorsQandCrespectively. This means that theMooreLikeandMealyLiketraits have pretty much become useless, as they still require the user to specify a bound on the edges.This will be addressed, once #35 is tackled since a better (unifying)
Automatontype will allow Moore and Mealy machines to be simple type aliases for some specific instantiation ofAutomaton.