Attainable upper estimate of the degree of distinguishability of a connected permutation automaton
In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter.
Gespeichert in:
| Veröffentlicht in: | Automatic control and computer sciences 2016, Vol.50 (8), p.749-758 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this work, we yield an attainable upper estimate of the degree of distinguishability of a connected permutation automaton with an assigned diameter. |
|---|---|
| ISSN: | 0146-4116 1558-108X |
| DOI: | 10.3103/S0146411616080034 |