Implicit prime compatible generation for minimizing incompletely specified finite state machines

Hiroyuki Higuchi, Yusuke Matsunaga

Research output: Contribution to conferencePaper

4 Citations (Scopus)

Abstract

This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. Proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's.

Original languageEnglish
Pages229-234
Number of pages6
Publication statusPublished - Dec 1 1995
EventProceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95 - Chiba, Jpn
Duration: Aug 29 1995Sep 1 1995

Other

OtherProceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95
CityChiba, Jpn
Period8/29/959/1/95

Fingerprint

Finite automata

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Higuchi, H., & Matsunaga, Y. (1995). Implicit prime compatible generation for minimizing incompletely specified finite state machines. 229-234. Paper presented at Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95, Chiba, Jpn, .

Implicit prime compatible generation for minimizing incompletely specified finite state machines. / Higuchi, Hiroyuki; Matsunaga, Yusuke.

1995. 229-234 Paper presented at Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95, Chiba, Jpn, .

Research output: Contribution to conferencePaper

Higuchi, H & Matsunaga, Y 1995, 'Implicit prime compatible generation for minimizing incompletely specified finite state machines' Paper presented at Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95, Chiba, Jpn, 8/29/95 - 9/1/95, pp. 229-234.
Higuchi H, Matsunaga Y. Implicit prime compatible generation for minimizing incompletely specified finite state machines. 1995. Paper presented at Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95, Chiba, Jpn, .
Higuchi, Hiroyuki ; Matsunaga, Yusuke. / Implicit prime compatible generation for minimizing incompletely specified finite state machines. Paper presented at Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95, Chiba, Jpn, .6 p.
@conference{b5e842a6a71d4221924248463f8e74f2,
title = "Implicit prime compatible generation for minimizing incompletely specified finite state machines",
abstract = "This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. Proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's.",
author = "Hiroyuki Higuchi and Yusuke Matsunaga",
year = "1995",
month = "12",
day = "1",
language = "English",
pages = "229--234",
note = "Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95 ; Conference date: 29-08-1995 Through 01-09-1995",

}

TY - CONF

T1 - Implicit prime compatible generation for minimizing incompletely specified finite state machines

AU - Higuchi, Hiroyuki

AU - Matsunaga, Yusuke

PY - 1995/12/1

Y1 - 1995/12/1

N2 - This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. Proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's.

AB - This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. Proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's.

UR - http://www.scopus.com/inward/record.url?scp=0029541553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029541553&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029541553

SP - 229

EP - 234

ER -