%0 Journal Article
%T Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
%A H.H. Hansen
%A J. Rutten
%J Scientific Annals of Computer Science
%D 2010
%I Alexandru Ioan Cuza University of Iasi
%X 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.
%U http://www.infoiasi.ro/bin/download/Annals/XX/XX_3.pdf