2001
DOI: 10.1016/s1383-7621(00)00038-2
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic two-dimensional minimization of strongly unspecified finite state machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…In [10], various encodings used in the design language VHDL are studied. In [11,12], the minimization of incompletely specified FSMs is studied. The method for the decomposition of FSMs described in [13] is designed for the minimization of the implementation cost and improving the perfor mance; the functional decomposition method presented in [14] is used for the implementation of FSMs using PLD memory blocks.…”
Section: Introductionmentioning
confidence: 99%
“…In [10], various encodings used in the design language VHDL are studied. In [11,12], the minimization of incompletely specified FSMs is studied. The method for the decomposition of FSMs described in [13] is designed for the minimization of the implementation cost and improving the perfor mance; the functional decomposition method presented in [14] is used for the implementation of FSMs using PLD memory blocks.…”
Section: Introductionmentioning
confidence: 99%