Sciweavers

495 search results - page 30 / 99
» Automata and differentiable words
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Expressiveness and Closure Properties for Quantitative Languages
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
FCCM
2008
IEEE
112views VLSI» more  FCCM 2008»
14 years 2 months ago
Power-Aware and Branch-Aware Word-Length Optimization
Power reduction is becoming more important as circuit size increases. This paper presents a tool called PowerCutter which employs accuracy-guaranteed word-length optimization to r...
William G. Osborne, José Gabriel F. Coutinh...
JSC
2010
83views more  JSC 2010»
13 years 2 months ago
Computing differential characteristic sets by change of ordering
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
François Boulier, François Lemaire, ...
ICALP
2005
Springer
14 years 1 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 2 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin