Sciweavers

283 search results - page 5 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
CASES
2006
ACM
13 years 11 months ago
State space reconfigurability: an implementation architecture for self modifying finite automata
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
Ka-Ming Keung, Akhilesh Tyagi
FASE
2009
Springer
14 years 2 months ago
Control Dependence for Extended Finite State Machines
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...
Kelly Androutsopoulos, David Clark, Mark Harman, Z...
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 12 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 2 months ago
Representation of a CPM Modulator through a Finite-State Sequential Machine
The well known decomposition of a CPM signal into PAM waveforms represents the linear part of a CPM modulator. The paper deals with the non–linear part, not fully developed in t...
Gianfranco Cariolaro, Alberto Vigato
COLING
2008
13 years 9 months ago
Hindi Urdu Machine Transliteration using Finite-State Transducers
Finite-state Transducers (FST) can be very efficient to implement inter-dialectal transliteration. We illustrate this on the Hindi and Urdu language pair. FSTs can also be used fo...
M. G. Abbas Malik, Christian Boitet, Pushpak Bhatt...