Published in Volume XX, 2010, pages 97-130

Authors: H.H. Hansen and J. Rutten

Abstract

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.

Full Text (PDF)

Bibtex

@article{sacscuza:hansen2010ssommfabf,
  title={Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions},
  author={H.H. Hansen and J. Rutten},
  journal={Scientific Annals of Computer Science},
  volume={20},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2010},
  pages={97--130},
  publisher={``A.I. Cuza'' University Press}
}