495 search results - page 30 / 99 » Automata and differentiable words |
182
click to vote
LICS
2009
IEEE
16 years 16 days ago
2009
IEEE
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 ...
131
click to vote
FCCM
2008
IEEE
16 years 11 days ago
2008
IEEE
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...
136
click to vote
JSC
2010
15 years 20 days ago
2010
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...
179
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
129
click to vote
TACAS
2010
Springer
16 years 26 days ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...