Abstract
State space exploration is important in the study of finite state sequential systems. The relative advantages of this symbolic state space representations in comparison to the standard deterministic finite state automaton representation of sequential systems are described. It also explores the relationship between linearly inductive functions (LIFs) and the classic DFA (deterministic finite state automaton) representation of a sequential function and examines the associated tradeoffs.
| Original language | English (US) |
|---|---|
| Pages | 111-116 |
| Number of pages | 6 |
| State | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors - Cambridge, MA, USA Duration: Oct 10 1994 → Oct 12 1994 |
Other
| Other | Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors |
|---|---|
| City | Cambridge, MA, USA |
| Period | 10/10/94 → 10/12/94 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering