Sciweavers

FCT
2007
Springer
13 years 11 months ago
P Systems with Adjoining Controlled Communication Rules
Mihai Ionescu, Dragos Sburlan
FCT
2007
Springer
13 years 11 months ago
Marked Systems and Circular Splicing
Clelia de Felice, Gabriele Fici, Rosalba Zizza
FCT
2007
Springer
13 years 11 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
FCT
2007
Springer
13 years 11 months ago
The Quantum Query Complexity of Algebraic Properties
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
Sebastian Dörn, Thomas Thierauf
FCT
2007
Springer
13 years 11 months ago
Path Algorithms on Regular Graphs
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
Didier Caucal, Dinh Trong Hieu
FCT
2007
Springer
13 years 11 months ago
On Block-Wise Symmetric Signatures for Matchgates
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
Jin-yi Cai, Pinyan Lu
FCT
2007
Springer
13 years 11 months ago
A String-Based Model for Simple Gene Assembly
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Robert Brijder, Miika Langille, Ion Petre
FCT
2007
Springer
13 years 11 months ago
Pattern Matching in Protein-Protein Interaction Graphs
Gaëlle Brevier, Romeo Rizzi, Stéphane ...