Sciweavers

77 search results - page 5 / 16
» Finite State Machine Decomposition For Low Power
Sort
View
COLING
1992
13 years 8 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
ACL
1997
13 years 8 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
13 years 5 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
ITCC
2002
IEEE
14 years 8 days ago
FSM Implementation in Embedded Memory Blocks of Programmable Logic Devices Using Functional Decomposition
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
Henry Selvaraj, Mariusz Rawski, Tadeusz Luba
DFT
2007
IEEE
104views VLSI» more  DFT 2007»
14 years 1 months ago
Reduction of Fault Latency in Sequential Circuits by using Decomposition
The paper discusses a novel approach for reduction of fault detection latency in a selfchecking sequential circuit. The Authors propose decomposing the finite state machine (FSM) ...
Ilya Levin, Benjamin Abramov, Vladimir Ostrovsky