This paper studies the language generated under fully decentralized su
pervision proposed by Kozak and Wonham, The authors assume that desira
ble behavior is specified as a closed language. They first present a c
losed-form expression for the language generated under fully decentral
ized supervision. Next, they show that the generated language is large
r than the supremal closed, controllable, and strongly decomposable su
blanguage, Moreover, they derive a necessary and sufficient condition
for the generated language to be the supremal closed and controllable
sublanguage.