Sciweavers

283 search results - page 10 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
IBPRIA
2009
Springer
14 years 8 days ago
Variable Order Finite-Context Models in DNA Sequence Coding
Abstract. Being an essential key in biological research, the DNA sequences are often shared between researchers and digitally stored for future use. As these sequences grow in volu...
Daniel A. Martins, António J. R. Neves, Arm...
MST
2002
97views more  MST 2002»
13 years 7 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
COLING
1994
13 years 9 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
ECBS
2004
IEEE
129views Hardware» more  ECBS 2004»
13 years 11 months ago
Closing the Gap Between Software Modelling and Code
If a software implementation is to be generated fully automatically from a model, then the model must be detailed and totally complete. For the definition of software implementing...
Ferdinand Wagner, T. Wagner, Peter Wolstenholme
ASM
2005
ASM
14 years 1 months ago
Modeling and Testing Hierarchical GUIs
Abstract. This paper presents a new approach to model and test hierarchical Graphical User Interfaces (GUIs). We exploit the structure of Hierarchical Finite State Machines (HFSMs)...
Ana Paiva, Nikolai Tillmann, João C. P. Far...