Optimal Control of Regular Languages with Event Disabling Cost

Research output: Contribution to journalConference articlepeer-review

17 Scopus citations


This paper presents an algorithm for optimal control of regular languages with penalty on event disabling. The performance index for the proposed optimal policy is obtained by combining the measure of the supervised plant language with the cost of disabled event(s). Synthesis of this optimal control policy requires at most n iterations, where n is the number of states of the DFSA model generated from the (open loop) regular language. The computational complexity of control synthesis is of a polynomial order in n.

Original languageEnglish (US)
Pages (from-to)1691-1695
Number of pages5
JournalProceedings of the American Control Conference
StatePublished - Nov 7 2003
Event2003 American Control Conference - Denver, CO, United States
Duration: Jun 4 2003Jun 6 2003

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimal Control of Regular Languages with Event Disabling Cost'. Together they form a unique fingerprint.

Cite this