Tradeoffs in canonical sequential function representations

Aarti Gupta, Allan L. Fisher

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

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 languageEnglish (US)
Pages111-116
Number of pages6
StatePublished - Dec 1 1994
Externally publishedYes
EventProceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors - Cambridge, MA, USA
Duration: Oct 10 1994Oct 12 1994

Other

OtherProceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors
CityCambridge, MA, USA
Period10/10/9410/12/94

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Tradeoffs in canonical sequential function representations'. Together they form a unique fingerprint.

Cite this