Add to ORKGThere are certain straightforward algorithms for laying out finite-state machines. This paper shows that these algorithm are optimal in the worst case for machines with fixed alphabets. That is, for any s and k, there is a deterministic finite-state machine with s states and k symbols such that any layout algorithm requires Ω(ks log s) area to lay out its realization. Similarly, any layout algorithm requires Ω(ks^2) area in the worst case for nondeterministic finite-state machines with s states and k symbols
We give an algorithm, its correctness proof, and its proof of execution time bound, for finding the ...
In this paper we prove a tight f~(n3) lower bound on the area of rectilinear grids which allow a per...
A generalization of the classical state minimization problem for finite state machine (FSM) is propo...
There are certain straightforward algorithms for laying out finite-state machines. This paper shows ...
We consider the state assignment problem as that of the decomposition of finite stare machines and t...
In this paper we address the state assignment problem for Finite State Machines (FSMs). In particula...
The purpose of this paper is to consider how memory requirements grow with the length of the input s...
This paper considers two estimation problems which occur during the implementation design for a fini...
Techniques have been proposed in the past for various types of finite state machine (FSM) decomposit...
[[abstract]]In this paper, we address the problem of state assignment to minimize both area and powe...
Abstract. We address the problem of selecting the minimum sized nite state machine consistent with g...
The paper describes an algorithm for automatic state assignment of finite state machines targeting a...
In this paper, we address the problem of FSM state assignment to minimize area and power. The object...
AbstractThe layout area of Boolean circuits is considered as a complexity measure of Boolean functio...
Abstract- The objective of this paper is to provide lower and upper bounds for the switching activit...
We give an algorithm, its correctness proof, and its proof of execution time bound, for finding the ...
In this paper we prove a tight f~(n3) lower bound on the area of rectilinear grids which allow a per...
A generalization of the classical state minimization problem for finite state machine (FSM) is propo...
There are certain straightforward algorithms for laying out finite-state machines. This paper shows ...
We consider the state assignment problem as that of the decomposition of finite stare machines and t...
In this paper we address the state assignment problem for Finite State Machines (FSMs). In particula...
The purpose of this paper is to consider how memory requirements grow with the length of the input s...
This paper considers two estimation problems which occur during the implementation design for a fini...
Techniques have been proposed in the past for various types of finite state machine (FSM) decomposit...
[[abstract]]In this paper, we address the problem of state assignment to minimize both area and powe...
Abstract. We address the problem of selecting the minimum sized nite state machine consistent with g...
The paper describes an algorithm for automatic state assignment of finite state machines targeting a...
In this paper, we address the problem of FSM state assignment to minimize area and power. The object...
AbstractThe layout area of Boolean circuits is considered as a complexity measure of Boolean functio...
Abstract- The objective of this paper is to provide lower and upper bounds for the switching activit...
We give an algorithm, its correctness proof, and its proof of execution time bound, for finding the ...
In this paper we prove a tight f~(n3) lower bound on the area of rectilinear grids which allow a per...
A generalization of the classical state minimization problem for finite state machine (FSM) is propo...