This paper studies the language generated under fully decentralized supervision proposed by Kozak and Wonham, The authors assume that desirable behavior is specified as a closed language. They first present a closed-form expression for the language generated under fully decentralized supervision. Next, they show that the generated language is larger than the supremal closed, controllable, and strongly decomposable sublanguage, Moreover, they derive a necessary and sufficient condition for the generated language to be the supremal closed and controllable sublanguage.