Cited By
View all- Abel AReineke JMarculescu DLiu F(2015)MeMinProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840833(94-101)Online publication date: 2-Nov-2015
Implicit prime compatible generation for minimizing incompletely specified finite state machines
Pages 36 - es
Abstract
No abstract available.
Index Terms
- Implicit prime compatible generation for minimizing incompletely specified finite state machines
Recommendations
Experiments on Minimization Method of Incompletely Specified Finite State Machines for Low Power Design
Computer Information Systems and Industrial ManagementAbstractThis paper presents a heuristic method for minimization of incompletely specified finite state machine with unspecified values of output variables. The proposed method is based on two states merging. In this method, such optimization criteria as ...
Minimization of incompletely specified mealy finite-state machines by merging two internal states
A heuristic method for the minimization of Mealy finite state machines (FSMs) with unspecified values of the output variables based on merging two states is considered. Necessary and sufficient conditions for the possibility to merge two states and for ...
On state reduction of incompletely specified finite state machines
State reduction of incompletely specified finite state machines (ISFSMs) is an important task in optimization of sequential circuit design and known as an NP-complete problem. Removal of redundant states reduces the logic, because of this, chip area ...
Comments
Information & Contributors
Information
Published In
August 1995
Copyright © 1995 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- IFIP WG 10.2: IFIP WG 10.2
- IFIP WG 10.5: IFIP WG 10.5
- ISPJ: ISPJ
- IEICE: Inst of Electronics, Info & Communication Engineers
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CAS: Circuits & Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1995
Check for updates
Qualifiers
- Article
Conference
ASPDAC95
Sponsor:
- IFIP WG 10.2
- IFIP WG 10.5
- ISPJ
- IEICE
- SIGDA
- IEEE-CAS
ASPDAC95: Asia Pacific Design Automation Conference
August 29 - September 1, 1995
Makuhari, Massa, Chiba, Japan
Acceptance Rates
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Upcoming Conference
ASPDAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
Cited By
View all- Abel AReineke JMarculescu DLiu F(2015)MeMinProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840833(94-101)Online publication date: 2-Nov-2015
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in