Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realises f. The synthesis algorithm can be seen as an analogue of Brzozowski's construction of a finite deterministic automaton from a regular expression. It is based on a coinductive characterisation of the operators of 2-adic arithmetic in terms of stream differential equations.
|Keywords||Mealy machines, bitstreams, synthesis, derivatives, 2-adic arithmetic|
|THEME||Software (theme 1)|
|Series||Software Engineering [SEN]|
Hansen, H.H, & Rutten, J.J.M.M. (2010). Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions. Software Engineering [SEN]. CWI.