Search Sciweavers | Sciweavers

We extend an algorithm by Paige and Tarjan that solves the coarsest stable reﬁnement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...

Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...

claim paper

Read More »

13

click to vote

IJFCS
2007

54views more IJFCS 2007»

Pure and O-Substitution

13 years 5 months ago

Download wwwtcs.inf.tu-dresden.de

The basic properties of distributivity and deletion of pure and o-substitution are investigated. The obtained results are applied to show preservation of recognizability in a numb...

Andreas Maletti

claim paper

Read More »

11

click to vote

IJFCS
2007

109views more IJFCS 2007»

Computational Power of intramolecular gene Assembly

13 years 5 months ago

Download combio.abo.fi

The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...

Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers