Sciweavers

TCS
2008
15 years 17 days 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 ...
91
Voted
TCS
2008
15 years 17 days ago
Multi-break rearrangements and chromosomal evolution
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
Max A. Alekseyev, Pavel A. Pevzner
93
Voted
TCS
2008
15 years 17 days ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
55
Voted
TCS
2008
15 years 17 days ago
Physical constraints on hypercomputation
W. Paul Cockshott, Lewis Mackenzie, Greg Michaelso...
93
Voted
TCS
2008
15 years 17 days ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
89
Voted
TCS
2008
15 years 17 days ago
Constructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
Arnon Avron
104
Voted
TCS
2008
15 years 17 days ago
Decidability and syntactic control of interference
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
James Laird