Sciweavers

283 search results - page 13 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
ICDT
2007
ACM
143views Database» more  ICDT 2007»
14 years 1 months ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
ICES
2001
Springer
78views Hardware» more  ICES 2001»
14 years 4 days ago
Embryonics: Artificial Cells Driven by Artificial DNA
Abstract. Embryonics is a long-term research project attempting to draw inspiration from the biological process of ontogeny, to implement novel digital computing machines endowed w...
Lucian Prodan, Gianluca Tempesti, Daniel Mange, An...
WIA
2001
Springer
14 years 3 days ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...
ICCAD
1998
IEEE
79views Hardware» more  ICCAD 1998»
13 years 11 months ago
Reencoding for cycle-time minimization under fixed encoding length
This paper presents efficient reencoding and resynthesis algorithms for cycle-time minimization of multilevel implementations of synchronous finite state machines (FSMs) under a fi...
Balakrishnan Iyer, Maciej J. Ciesielski
ANLP
1997
106views more  ANLP 1997»
13 years 9 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod