text: abstract—complexity analysis becomes a common task in
  supervisory control. however, many results of interest are spread
  across different topics. the aim of this paper is to bring several
  interesting results from complexity theory and to illustrate their
  relevance to supervisory control by proving new nontrivial results
  concerning nonblockingness in modular supervisory control of
  discrete event systems modeled by finite automata.
  index terms—discrete event systems; finite automata; modular control; complexity.