Sciweavers

493 search results - page 13 / 99
» Alternating Weighted Automata
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Minimal weight expansions in Pisot bases
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
Christiane Frougny, Wolfgang Steiner
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Rational streams coalgebraically
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
Jan J. M. M. Rutten
DLT
2004
13 years 9 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
CDC
2009
IEEE
162views Control Systems» more  CDC 2009»
14 years 6 days ago
Distributed optimal planning: an approach by weighted automata calculus
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
Eric Fabre, Loig Jezequel
FMSD
2007
97views more  FMSD 2007»
13 years 7 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...