Finite automata approach to observability of switched Boolean control networks (Q901271)
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: Finite automata approach to observability of switched Boolean control networks |
scientific article; zbMATH DE number 6524115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata approach to observability of switched Boolean control networks |
scientific article; zbMATH DE number 6524115 |
Statements
Finite automata approach to observability of switched Boolean control networks (English)
0 references
23 December 2015
0 references
switched Boolean control network
0 references
observability
0 references
weighted pair graph
0 references
finite automaton
0 references
formal language
0 references
semi-tensor product of matrices
0 references
0 references
0 references
0 references
0 references
0.9621104
0 references
0.90561515
0 references
0.90278673
0 references
0.90177315
0 references
0.90116334
0 references
0.8940716
0 references
0.8936808
0 references
0 references
0.8917055
0 references
