Sciweavers

495 search results - page 46 / 99
» Automata and differentiable words
Sort
View
TCS
2010
13 years 2 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen
STACS
2007
Springer
14 years 1 months ago
A First Investigation of Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 7 months ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
JCB
2000
103views more  JCB 2000»
13 years 7 months ago
Testing for Differentially-Expressed Genes by Maximum-Likelihood Analysis of Microarray Data
Although two-color uorescent DNA microarrays are now standard equipment in many molecular biology laboratories, methods for identifying differentially expressed genes in microarra...
Trey Ideker, Vesteinn Thorsson, Andrew F. Siegel, ...