83 search results - page 15 / 17 » tcs 2010 |
TCS
2010
15 years 10 days ago
2010
When representing DNA molecules as words, it is necessary to take into account the fact that a word u encodes basically the same information as its Watson-Crick complement θ(u), w...
TCS
2010
15 years 10 days ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
104
click to vote
RP
2010
Springer
15 years 11 days ago
2010
Springer
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
146
click to vote
TCS
2010
15 years 10 days ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
TCS
2010
15 years 10 days ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...