34 search results - page 5 / 7 » A characterization of fine words over a finite alphabet |
ITA
2006
14 years 9 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
FORTE
2009
14 years 7 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, becaus...
COMBINATORICS
2004
14 years 9 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...