83 search results - page 10 / 17 » tcs 2010 |
TCS
2010
14 years 4 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
TCS
2010
14 years 4 months ago
2010
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
TCS
2010
14 years 8 months ago
2010
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
TCS
2010
14 years 4 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
TCS
2010
14 years 8 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...