Sciweavers

CUZA
2010
150views Cryptology» more  CUZA 2010»
13 years 9 months ago
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
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 realise...
Helle Hvid Hansen, Jan J. M. M. Rutten
JUCS
2002
110views more  JUCS 2002»
13 years 11 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa