Symbolic synthesis of Mealy machines from arithmetic bitstream functions

H.H. Hansen, J.J.M.M. Rutten

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
44 Downloads (Pure)

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 languageEnglish
Pages (from-to)97-130
JournalScientific Annals of Computer Science
Volume20
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'Symbolic synthesis of Mealy machines from arithmetic bitstream functions'. Together they form a unique fingerprint.

Cite this