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.
| Original language | English |
|---|---|
| Pages (from-to) | 97-130 |
| Journal | Scientific Annals of Computer Science |
| Volume | 20 |
| Publication status | Published - 2010 |