Complexity of deciding detectability in discrete event systems (Q1797011)
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: Complexity of deciding detectability in discrete event systems |
scientific article; zbMATH DE number 6957773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of deciding detectability in discrete event systems |
scientific article; zbMATH DE number 6957773 |
Statements
Complexity of deciding detectability in discrete event systems (English)
0 references
17 October 2018
0 references
discrete event systems
0 references
finite automata
0 references
detectability
0 references
complexity
0 references
0 references
0.8607495427131653
0 references
0.8588128089904785
0 references
0.8474980592727661
0 references
0.8411058187484741
0 references
0.8105427026748657
0 references
