Results 1  10
of
12
Solving and factoring boundary problems for linear ordinary differential equations in differential algebras
 Journal of Symbolic Computation
"... We present a new approach for expressing and solving boundary problems for linear ordinary differential equations in the language of differential algebras. Starting from an algebra with a derivation and integration operator, we construct a ring of linear integrodifferential operators that is expres ..."
Abstract

Cited by 27 (17 self)
 Add to MetaCart
We present a new approach for expressing and solving boundary problems for linear ordinary differential equations in the language of differential algebras. Starting from an algebra with a derivation and integration operator, we construct a ring of linear integrodifferential operators that is expressive enough for specifying regular boundary problems with arbitrary Stieltjes boundary conditions as well as their solution operators. Based on these structures, we define a new multiplication on regular boundary problems in such a way that the resulting Green’s operator is the reverse composition of the constituent Green’s operators. We provide also a method for lifting any factorization of the underlying differential operator to the level of boundary problems. Since this method only needs the computation of initial value problems, it can be used as an effective alternative for computing Green’s operators in case one knows how to factor the given differential operators.
Equational axioms for probabilistic bisimilarity
 IN PROCEEDINGS OF 9TH AMAST, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (#)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity.
On TorsionFree Semigroups Generated by Invertible Reversible Mealy Automata
"... ar ..."
(Show Context)
cernyJournalFinal A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONECLUSTER AUTOMATA
"... Čern´y’s conjecture asserts the existence of a synchronizing word of length at most (n− 1) 2 for any synchronized nstate deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized nstate deterministic automaton satisfying the following addi ..."
Abstract
 Add to MetaCart
(Show Context)
Čern´y’s conjecture asserts the existence of a synchronizing word of length at most (n− 1) 2 for any synchronized nstate deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized nstate deterministic automaton satisfying the following additional property: there is a letter a such that for any pair of states p,q, one has p·a r = q·a s for some integers r,s (for a state p and a word w, we denote by p·w the state reached from p by the path labeled w). As a consequence, we show that for any finite synchronized prefix code with an nstate decoder, there is a synchronizing word of length O(n 2). This applies in particular to Huffman codes.
Random Group Automata
, 2000
"... A group automaton is a complete deterministic automaton such that each letter of the alphabet acts on the set of states as a permutation [1, 5]. The aim is to describe an algorithm for the random generation of a minimal group automaton with n states. The treatment is largely based on properties of r ..."
Abstract
 Add to MetaCart
A group automaton is a complete deterministic automaton such that each letter of the alphabet acts on the set of states as a permutation [1, 5]. The aim is to describe an algorithm for the random generation of a minimal group automaton with n states. The treatment is largely based on properties of random permutations and random automata.
Semiring Articial Neural Networks and Weighted Automata And an Application to Digital Image Encoding
"... Abstract. In their seminal paper [1] McCulloch and Pitts have shown the strong relationship between nite automata and socalled McCullochPitts networks. Our goal is to extend this result to weighted automata. In other words, we want to integrate articial neural networks and weighted automata. For t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In their seminal paper [1] McCulloch and Pitts have shown the strong relationship between nite automata and socalled McCullochPitts networks. Our goal is to extend this result to weighted automata. In other words, we want to integrate articial neural networks and weighted automata. For this task, we introduce semiring articial neural networks, that is, articial neural networks which implement the addition and the multiplication of semirings. We present a construction of a semiring articial neural network from a given weighted automaton, and back again. After that, we show how we can approach the problem of encoding an image into a weighted automaton by using a semiring articial neural network in this process. 1