A weighted pair graph representation for reconstructibility of Boolean control networks (Q2833528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6654648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A weighted pair graph representation for reconstructibility of Boolean control networks |
scientific article; zbMATH DE number 6654648 |
Statements
18 November 2016
0 references
Boolean control network
0 references
reconstructibility
0 references
weighted pair graph
0 references
finite automaton
0 references
formal language
0 references
semitensor product of matrices
0 references
0 references
0 references
A weighted pair graph representation for reconstructibility of Boolean control networks (English)
0 references
0.8061943054199219
0 references
0.7641406059265137
0 references
0.7258546352386475
0 references
0.7221283316612244
0 references
0.7189784049987793
0 references
