Sciweavers

221 search results - page 2 / 45
» Periodic and Sturmian languages
Sort
View
TCS
2008
13 years 5 months ago
A characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
Amy Glen
TCS
2002
13 years 5 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon
DAM
2007
88views more  DAM 2007»
13 years 5 months ago
Digital planarity - A review
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...
HASE
2008
IEEE
13 years 12 months ago
A Multi-Periodic Synchronous Data-Flow Language
Implementing real-time critical systems is an increasingly complex process that calls for high-level formal programming languages. Existing languages mainly focus on mono-periodic...
Julien Forget, Frédéric Boniol, Davi...
ICALP
2010
Springer
13 years 10 months ago
Scheduling Periodic Tasks in a Hard Real-Time Environment
Friedrich Eisenbrand, Nicolai Hähnle, Martin ...