18 search results - page 4 / 4 » A Proof of Regularity for Finite Splicing |
STRINGOLOGY
2008
13 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
FOSSACS
2006
Springer
13 years 9 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
ECCC
2010
13 years 5 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...