A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The infimal prefix-closed, controllable and observable superlanguage plays an essential role in the relationship between controllability, observability and co-observability -- the central notions of supervisory control theory. Existing algorithms for its computation are exponential and it is not known whether a polynomial algorithm exists. In this paper, we study the state complexity of this language. State complexity of a language is the number of states of the minimal DFA for the language.arXiv:1703.05016v1 fatcat:j2th53g4zbb6hlyeb5wuzpa4ie