You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Retracing some paths in Process Algebra defines a trace/feedback operator for Mealy machines that connects an output back to an input. This is like ArrowLoop but with a sum instead of a product. It can be implemented like this:
trace::foralleab.Mealy (Eitherea) (Eithereb) ->Mealyab
trace m0 =Mealy$\x -> go m0 (Right x)
wherego::Mealy (Eitherea) (Eithereb) ->Eitherea-> (b, Mealyab)
go (Mealy f) x =case f x of
(Left e, m) -> go m (Left e)
(Right y, m) -> (y, trace m)
Maybe this would be useful for other machines as well.
The text was updated successfully, but these errors were encountered:
Retracing some paths in Process Algebra defines a trace/feedback operator for Mealy machines that connects an output back to an input. This is like
ArrowLoop
but with a sum instead of a product. It can be implemented like this:Maybe this would be useful for other machines as well.
The text was updated successfully, but these errors were encountered: