Login / Signup
Using the theories of finite automata and formal languages to determine observability of switched Boolean control networks.
Kuize Zhang
Lijun Zhang
Lihua Xie
Zhe Jiang
Published in:
CDC (2015)
Keyphrases
</>
finite automata
formal languages
deterministic automata
grammatical inference
context free grammars
regular expressions
switched networks
formal language theory
tree automata
artificial intelligence
boolean functions
high level
natural language
knowledge acquisition