Minimization of incompletely specified Mealy finite-state machines by merging two internal states (Q393671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimization of incompletely specified Mealy finite-state machines by merging two internal states |
scientific article; zbMATH DE number 6249766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of incompletely specified Mealy finite-state machines by merging two internal states |
scientific article; zbMATH DE number 6249766 |
Statements
Minimization of incompletely specified Mealy finite-state machines by merging two internal states (English)
0 references
23 January 2014
0 references
Mealy finite-state machines
0 references
number of internal states
0 references
state pairs
0 references
Stamina computer program
0 references
heuristic method
0 references
0 references
0 references
0 references
0 references
0 references
0.9005832076072693
0 references
0.8585622310638428
0 references
0.833873450756073
0 references
0.8286820650100708
0 references
0.8098456263542175
0 references
