Shortest Trajectories and Reversibility in Boolean Automata Networks
Discrete Mathematics
2017-07-04 v2 Formal Languages and Automata Theory
Abstract
The question this research report explores is the following: when does a shortest trajectory between two configurations, or between one configuration and an attractor need to change several times the state of one automaton?
Keywords
Cite
@article{arxiv.1606.02613,
title = {Shortest Trajectories and Reversibility in Boolean Automata Networks},
author = {Mathilde Noual},
journal= {arXiv preprint arXiv:1606.02613},
year = {2017}
}