Results 1 
8 of
8
The X Window System
 Department of Computer Engineering at the University of Istanbul. His
, 1990
"... Mining interesting association rules from customer databases and transaction databases ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Mining interesting association rules from customer databases and transaction databases
A.: Coalgebraic Logic and Synthesis of Mealy Machines
"... Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every formula into a finite Mealy machine whose behaviour is exactly the set of causal functions satisfying the formula. 1
A.: Regular expressions for polynomial coalgebras
"... CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.
Coalgebraic Foundations of Linear Systems (An Exercise in Stream Calculus)
"... Abstract. Viewing discretetime causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the final coalgebras of streams and causal stream functions. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Viewing discretetime causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the final coalgebras of streams and causal stream functions. 1
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 realises f. The synthesis algorithm can be seen as an analogue of Brzozowski’s construction of a finite deterministic automaton ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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 2adic arithmetic in terms of stream differential equations. 1
Mealy Synthesis of Arithmetic Bitstream Functions
"... A (binary) Mealy machine is a deterministic automaton which in each step reads an input bit, produces an output bit and moves to a next state. The induced mapping of input streams to output streams is a causal bitstream function, which we call the bitstream function realised by the Mealy machine. In ..."
Abstract
 Add to MetaCart
A (binary) Mealy machine is a deterministic automaton which in each step reads an input bit, produces an output bit and moves to a next state. The induced mapping of input streams to output streams is a causal bitstream function, which we call the bitstream function realised by the Mealy machine. In this note, we describe a synthesis method which given an algebraic specification of a bitstream function f, constructs a minimal Mealy machine which realises f. In the design of digital hardware, Mealy machines specify the behaviour of sequential circuits, and there exist algorithms which construct from a (finite) Mealy machine, a sequential circuit which exhibits the specified behaviour. Combining these algorithms with our synthesis algorithm we thus obtain a complete construction from algebraic specification to sequential circuit. The inputs to our synthesis algorithm are called function expressions and they define bitstream functions in the algebra of 2adic numbers. Here we use that the formal power series representation of a 2adic integer can be seen as the bitstream of its coefficients. We describe the 2adic algebra below, but for now such a function