Sciweavers

4674 search results - page 565 / 935
» cases 2008
Sort
View
TCS
2008
15 years 6 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
TCS
2008
15 years 6 months ago
Compositional semantics and behavioral equivalences for P Systems
The aim of the paper is to give a compositional semantics in the style of the Structural Operational Semantics (SOS) and to study behavioral equivalence notions for P Systems. Fir...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
TCS
2008
15 years 6 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
IPL
2007
111views more  IPL 2007»
15 years 6 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
181
Voted
TCS
2008
15 years 6 months ago
Quasiperiodic and Lyndon episturmian words
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
Amy Glen, Florence Levé, Gwénaë...