Sciweavers

307 search results - page 7 / 62
» On Equations over Sets of Integers
Sort
View
CADE
2009
Springer
14 years 8 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
ICALP
2007
Springer
13 years 11 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
ENDM
2007
96views more  ENDM 2007»
13 years 7 months ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
IFIPTCS
2000
13 years 11 months ago
Masaccio: A Formal Model for Embedded Components
Masaccio is a formal model for hybrid dynamical systems which are built from atomic discrete components (di erence equations) and atomic continuous components (di erential equation...
Thomas A. Henzinger