Academic Journals Database
Disseminating quality controlled scientific knowledge

Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions

ADD TO MY LIST
 
Author(s): H.H. Hansen | J. Rutten

Journal: Scientific Annals of Computer Science
ISSN 1843-8121

Volume: 20;
Start page: 97;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

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.
RPA Switzerland

RPA Switzerland

Robotic process automation

    

Tango Rapperswil
Tango Rapperswil