Sciweavers

495 search results - page 17 / 99
» Automata and differentiable words
Sort
View
MFCS
2009
Springer
14 years 2 months ago
Bounds on Non-surjective Cellular Automata
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
Jarkko Kari, Pascal Vanier, Thomas Zeume
FSMNLP
2005
Springer
14 years 1 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
FSE
2007
Springer
128views Cryptology» more  FSE 2007»
13 years 11 months ago
Differential-Linear Attacks Against the Stream Cipher Phelix
The previous key recovery attacks against Helix obtain the key with about 288 operations using chosen nonces (reusing nonce) and about 1000 adaptively chosen plaintext words (or 23...
Hongjun Wu, Bart Preneel
SIMULATION
2002
103views more  SIMULATION 2002»
13 years 7 months ago
The Trend Cellular Automata Programming Environment
Trend is a two dimensional cellular automata programming environment with an integrated simulator and a compiler. Trend has many unique features such as simulation backtracking, c...
Hui-Hsien Chou, Wei Huang, James A. Reggia
APNOMS
2006
Springer
13 years 11 months ago
Performance Analysis of Service Differentiation for IEEE 802.15.4 Slotted CSMA/CA
In this paper, we propose two mechanisms, differentiation by backoff exponent and differentiation by the size of contention window, for IEEE 802.15.4 sensor networks to provide mul...
Meejoung Kim